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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PPC(x) __builtin_popcountll(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define LSB(x) __builtin_ctz(x)
#define ARG(x, i) (get<i>(x))
#define ithBit(m, i) ((m) >> (i) & 1)
#define pb push_back
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std; 

template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b);	}

using Ky = vector <int>;

const int maxN = 1 << 17, INF = 1 << 30;

int res[maxN];

void solve()
{
	int a, b, c, x, y, z;
	scanf ("%d%d%d%d%d%d", &a, &b, &c, &x, &y, &z);
	fill(res, res+c+1, INF);
	
	vector <int> S {a, b, c};
	set <Ky> vis;
	priority_queue <pair <int, Ky> > H;
	H.push({0, {x, y, z}});
		
	while (!H.empty())
	{
		auto [d, T] = H.top();
		H.pop();
		
		if (vis.find(T) != vis.end())
			continue;
			
		for (int i : T)
			remin(res[i], -d);
		vis.insert(T);
		
		dbg(T), dbg(-d), dbg("==\n");
		
		FOR(i, 0, 3) FOR(j, 0, 3) if (j != i)
		{
			int dx = min(T[i], S[j] - T[j]);
			T[i] -= dx, T[j] += dx;
			
			if (vis.find(T) == vis.end())
				H.push({d-1, T});
			
			T[i] += dx, T[j] -= dx;
		}
		
	}
	
	FOR(i, 0, c+1)
		printf("%d ", res[i] == INF ? -1 : res[i]);
	printf("\n");
}
 
int main()
{
	int t = 1;
	//scanf ("%d", &t);
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}