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
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   Vi         = vector<int>;
using   Pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

constexpr int INF = 1e9;
using triple = array<int, 3>;

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(12);

	int lim[3];
	rep(i, 0, 3) cin >> lim[i];

	triple s;
	rep(i, 0, 3) cin >> s[i];

	Vi ans(lim[2]+1, INF);
	map<triple, int> dist;
	queue<triple> que;
	que.push(s);
	dist[s] = 1;

	while (!que.empty()) {
		triple v = que.front();
		que.pop();
		int d = dist[v]-1;
		rep(i, 0, 3) ans[v[i]] = min(ans[v[i]], d);
		rep(i, 0, 3) rep(j, 0, 3) if (i != j) {
			triple u = v;
			int x = min(v[i], lim[j]-u[j]);
			u[i] -= x;
			u[j] += x;
			int& dst = dist[u];
			if (!dst) {
				dst = d+2;
				que.push(u);
			}
		}
	}

	each(a, ans) cout << (a != INF ? a : -1) << ' ';
	cout << '\n';
	return 0;
}