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
#include<bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pi>;
#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 ALL(c) (c).begin(), (c).end()
#define ALLD(c) (c).rbegin(), (c).rend()
#define SIZE(x) ((int)(x).size())
#define pb push_back
#define pp emplace_back
#define st first
#define nd second
#define sq(a) (a)*(a)
const int inf = 1000000001;
const double eps = 1e-9;
bool fleq(double a, double b){
	return abs(a - b) < eps;
}

map<pair<pair<int,int>,int>, bool>vis;
int A, B, C;
int a, b, c;
int ans[100100];
queue<pair<pi, pi> >Q;
int main(){
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        cin >> A >> B >> C >> a >> b >> c;
        FOR(i, 0, C)ans[i] = -1;
        Q.push({{a,b},{c, 0}});
        while(!Q.empty()){
                int x = Q.front().st.st;
                int y = Q.front().st.nd;
                int z = Q.front().nd.st;
                int d = Q.front().nd.nd;
                Q.pop();
                if(vis[{{x,y},z}])continue;
                vis[{{x,y},z}] = true;
                if(ans[x] == -1)ans[x] = d;
                if(ans[y] == -1)ans[y] = d;
                if(ans[z] == -1)ans[z] = d;
                int m = x;
                int n = y;
                int o = z;
                int temp = x;
                m = min(m + n, A);
                n -= (m - temp);
                if(!vis[{{m,n},o}])Q.push({{m,n},{o,d+1}});
                m = x;
                n = y;
                o = z;
                temp = z;
                o = min(o + n, C);
                n -= (o - temp);
                if(!vis[{{m,n},o}])Q.push({{m,n},{o,d+1}});
                m = x;
                n = y;
                o = z;
                temp = x;
                m = min(m + o, A);
                o -= (m - temp);
                if(!vis[{{m,n},o}])Q.push({{m,n},{o,d+1}});
                m = x;
                n = y;
                o = z;
                temp = y;
                n = min(n + o, B);
                o -= (n - temp);
                if(!vis[{{m,n},o}])Q.push({{m,n},{o,d+1}});
                m = x;
                n = y;
                o = z;
                temp = y;
                n = min(n + m, B);
                m -= (n - temp);
                if(!vis[{{m,n},o}])Q.push({{m,n},{o,d+1}});
                m = x;
                n = y;
                o = z;
                temp = z;
                o = min(o + m, C);
                m -= (o - temp);    
                if(!vis[{{m,n},o}])Q.push({{m,n},{o,d+1}});
        }
        FOR(i, 0, C){
                cout << ans[i] << ' ';
        }
                
        
}