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;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define sz(v) ((int)(v).size())

#define vec1d(x) vector<x>
#define vec2d(x) vector<vec1d(x)>
#define vec3d(x) vector<vec2d(x)>
#define vec4d(x) vector<vec3d(x)>

#define ivec1d(x, n, v) vec1d(x)(n, v)
#define ivec2d(x, n, m, v) vec2d(x)(n, ivec1d(x, m, v))
#define ivec3d(x, n, m, k, v) vec3d(x)(n, ivec2d(x, m, k, v))
#define ivec4d(x, n, m, k, l, v) vec4d(x)(n, ivec3d(x, m, k, l, v))

#ifdef LOCAL
#include "pretty_print.h"
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

#define nl "\n"

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

template <typename T> T sqr(T x) { return x * x; }
template <typename T> T abs(T x) { return x < 0? -x : x; }
template <typename T> T gcd(T a, T b) { return b? gcd(b, a % b) : a; }
template <typename T> bool chmin(T &x, const T& y) { if (x > y) { x = y; return true; } return false; }
template <typename T> bool chmax(T &x, const T& y) { if (x < y) { x = y; return true; } return false; }

auto random_address = [] { char *p = new char; delete p; return (uint64_t) p; };
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1));
mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1));


int main(int /* argc */, const char** /* argv */)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
#ifdef LOCAL
    assert(freopen("i.txt", "r", stdin));
    assert(freopen("o.txt", "w", stdout));
#endif

    const int INF = 2e+9 + 42;

    int A, B, C, a, b, c;
    cin >> A >> B >> C >> a >> b >> c;
    vector<int> f(C + 1, INF);
    set<tuple<int, int, int>> s;
    queue<tuple<int, int, int, int>> q;

    auto add = [&](int a, int b, int c, int d) {
        auto k = make_tuple(a, b, c);
        if (s.count(k)) {
            return;
        }
        s.insert(k);
        chmin(f[a], d);
        chmin(f[b], d);
        chmin(f[c], d);
        q.push({a, b, c, d});
    };

    add(a, b, c, 0);
    while (q.size()) {
        auto [a, b, c, d] = q.front();
        q.pop();
        add(a + min(A - a, b), b - min(A - a, b), c, d + 1);
        add(a - min(a, B - b), b + min(a, B - b), c, d + 1);
        add(a + min(A - a, c), b, c - min(A - a, c), d + 1);
        add(a - min(a, C - c), b, c + min(a, C - c), d + 1);
        add(a, b + min(B - b, c), c - min(B - b, c), d + 1);
        add(a, b - min(b, C - c), c + min(b, C - c), d + 1);
    }

    for (int i = 0; i <= C; ++i) {
        i && cout << " ";
        cout << (f[i] == INF? -1 : f[i]);
    }
    cout << nl;

#ifdef LOCAL
    cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec" << endl;
#endif
    return 0;
}