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
#include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <math.h>
using namespace __gnu_pbds;
using namespace std;
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(c) (c).begin(), (c).end()
#define sz(X) (int)((X).size())
typedef long double ld;
typedef unsigned long long ull;
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; // find_by_order(x) <-returns x-th element   order_of_key(x) <- returns order of element x
// mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());uniform_int_distribution<int> distr(0, 1e9);auto my_rand = bind(distr, gen); // my_rand() zwraca teraz liczbe z przedzialu [a, b]
#ifdef LOCAL
ostream &operator<<(ostream &out, string str) {
   for (char c : str)
      out << c;
   return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; }
template <class L, class R, class S> ostream &operator<<(ostream &out, tuple<L, R, S> p) {
   auto &[a, b, c] = p;
   return out << "(" << a << ", " << b << ", " << c << ")";
}
template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
   out << '{';
   for (auto it = a.begin(); it != a.end(); it = next(it))
      out << (it != a.begin() ? ", " : "") << *it;
   return out << '}';
}
void dump() { cerr << "\n"; }
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define int long long

typedef array<int, 3> tpl;
vector<pii> all = {{0, 1}, {1, 0}, {2, 0}, {0, 2}, {2, 1}, {1, 2}};
tpl T;

tpl transform(tpl X, pii P) {
   auto [s, t] = P;
   int m = min(X[s], T[t] - X[t]);
   X[s] -= m;
   X[t] += m;
   return X;
}

vector<tpl> getN(tpl &x) {
   vector<tpl> res;
   for (auto P : all)
      res.push_back(transform(x, P));
   return res;
}

void mini(tpl &x, int t, vector<int> &res) {
   for (auto a : x)
      if (res[a] == -1)
         res[a] = t;
}

const ll MAXN = 1e6;
const ll MAXS = MAXN * MAXN;

ll to_l(tpl x) {
   auto [a, b, c] = x;
   return a + b * MAXN + c * MAXS;
}

int32_t main() {
   _upgrade;
   int A, B, C;
   cin >> A >> B >> C;
   T = {A, B, C};
   vector<int> res(C + 1, -1);

   queue<pair<int, tpl>> Q;
   int a, b, c;
   cin >> a >> b >> c;

   unordered_set<ll> vis = {to_l({a, b, c})};
   vis.reserve(2e6);

   Q.push({0, {a, b, c}});

   while (!Q.empty()) {
      auto [d, x] = Q.front();
      Q.pop();
      mini(x, d, res);
      for (auto t : getN(x))
         if (vis.insert(to_l(t)).nd)
            Q.push({d + 1, t});
   }

   for (int d : res)
      cout << d << " ";
   cout << endl;
}