1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
#include <bits/stdc++.h>
using namespace std;
//{
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define all(v) (v).begin(),(v).end()
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define PII pair<int,int>
#define st first
#define nd second
#define pb push_back
#define lint long long int
#define VI vector<lint>

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
};
//{
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue

#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}
#define jeb() fflush(stdout);
//}

const int max_n = 1e6 + 5;

int ans[max_n];

int skad[] = {0,0,1,1,2,2};
int dokad[] = {1,2,0,2,0,1};

set<pair<PII, int> > vis;



int main() {
	makev(v, 3);
	makev(in, 3);
	FOR(i,0,v[2]+1) ans[i] = 1e9;
	
	vector<pair<PII, PII> > q;
	q.pb({{in[0], in[1]}, {in[2], 0}}); 
	vis.insert({{in[0], in[1]}, in[2]});
	int act = 0;
	while (act < q.size()) {
		VI inc = {q[act].st.st, q[act].st.nd, q[act].nd.st};
		int mvs = q[act].nd.nd;
		act++;
		FOR(i,0,3) {
			ans[inc[i]] = min(ans[inc[i]], mvs);
		}
		vis.insert({{inc[0], inc[1]}, inc[2]});
		FOR(j,0,6) {
			VI nn = inc;
			int i1 = skad[j], i2 = dokad[j];
			
			int ile = min(v[i2]-nn[i2], nn[i1]);
			nn[i1] -= ile;
			nn[i2] += ile;
			if (vis.find({{nn[0], nn[1]},nn[2]}) != vis.end()) continue;
			q.pb({{nn[0], nn[1]},{nn[2], mvs+1}});
		}
	}

	FOR(i,0,v[2]+1) if (ans[i] == 1e9) ans[i] = -1;
	FOR(i,0,v[2]+1) {
		printf("%d ", ans[i]);
	}
	printf("\n");
}