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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>

using namespace std;

typedef vector<int> VI;
typedef long long LL;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int INF = 1e9 + 7;

int main() {
	ios_base::sync_with_stdio(0);
    VI b(3), a(3);
    cin >> a[0] >> a[1] >> a[2] >> b[0] >> b[1] >> b[2];
    VI res(a[2] + 1, INF);
    res[b[0]] = res[b[1]] = res[b[2]] = 0;
    queue<pair<int, VI> > q;
    set<VI > analyzed;
    q.push({0, {b[0], b[1], b[2]}});
    while(!q.empty()) {
        auto x = q.front();
        q.pop();
        REP(i, 3)
            REP(j, 3) {
                if(i == j) continue;
                VI tmp(x.second);
                int diff = min(tmp[i], a[j] - tmp[j]);
                res[tmp[j] + diff] = min(res[tmp[j] + diff], x.first + 1);
                res[tmp[i] - diff] = min(res[tmp[i] - diff], x.first + 1);
                tmp[j] += diff;
                tmp[i] -= diff;
                if(analyzed.find(tmp) == analyzed.end()) {
                    q.push({x.first + 1, tmp});
                    analyzed.insert(tmp);
                }
            }
    }
    REP(i, res.size()) {
        cout << (res[i] == INF ? -1 : res[i]) << ' ';
    }
    cout << '\n';

    return 0;
}