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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
#include <bits/stdc++.h>

using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void canhazfast() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
    T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
    while (b) {
        T q = a/b; a %= b; swap(a, b);
        x0 -= q*x1; swap(x0, x1);
        y0 -= q*y1; swap(y0, y1);
    }
    x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}

typedef array<int, 3> S;

#define MX 100016

int sum;
S cap;
vpii q;
int ans[MX];
int dist[6][MX];

int inc(int i) { return i < 2 ? i+1 : 0; }

int getpos(const S &x)
{
    for (int i : {0, 1, 2}) {
        retif(x[i] == 0) 2*i;
        retif(x[i] == cap[i]) 2*i+1;
    }
    return -1;
}

pii pack(const S &x)
{
    int pos = getpos(x);
    pii res = {pos, x[inc(pos/2)]};
    return res;
}

S unpack(const pii &p)
{
    S res;
    int i = p.fir/2;
    int j = inc(i);
    int k = inc(j);
    res[i] = p.fir%2 ? cap[i] : 0;
    res[j] = p.sec;
    res[k] = sum-res[i]-res[j];
    return res;
}

vector<S> gen(const S &x)
{
    vector<S> res;
    for (int i : {0, 1, 2}) {
        for (int j : {0, 1, 2}) {
            ctif(i == j);
            S y = x;
            int t = min(y[i], cap[j]-y[j]);
            y[i] -= t;
            y[j] += t;
            res.pb(y);
        }
    }
    return res;
}

void optimize(const S &s, int d)
{
    for (int i : {0, 1, 2}) {
        int v = s[i];
        ans[v] = ans[v] < 0 ? d : min(ans[v], d);
    }
}

void put(const S &v, int d)
{
    pii p = pack(v);
    if (dist[p.fir][p.sec] > d) {
        dist[p.fir][p.sec] = d;
        q.pb(p);
    }
}

int main()
{
    canhazfast();

    S init;

    for (int i : {0, 1, 2}) cin >> cap[i];
    for (int i : {0, 1, 2}) {
        cin >> init[i];
        sum += init[i];
    }

    fill_n(ans, cap[2]+1, -1);
    for (int i = 0; i < 6; ++i) fill_n(dist[i], cap[2]+1, 6*MX);

    if (getpos(init) < 0) {
        optimize(init, 0);
        for (S v : gen(init)) put(v, 1);
    } else {
        put(init, 0);
    }

    for (size_t i = 0; i < q.size(); ++i) {
        pii u = q[i];
        S su = unpack(u);
        int du = dist[u.fir][u.sec];
        //cerr << "u = [" << su[0] << ", " << su[1] << ", " << su[2] << ") = [" << u.fir << ", " << u.sec << "], d = " << du << '\n';
        optimize(su, du);
        for (S v : gen(su)) put(v, du+1);
    }

    for (int i = 0; i <= cap[2]; ++i) cout << ans[i] << ' ';
    cout << '\n';

    return 0;
}