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
//Sylwia Sapkowska
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double LD;
 
typedef pair<int, int> pii;
typedef pair<LL,LL> pll;
typedef pair<LD,LD> pdd;
 
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<LD> vld;
typedef vector<LL> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define rep(i, a, b) for (int i=a; i<(b); i++)
#define repd(i,a,b) for (int i = (a); i >= b; i--)
#define sz(x) (int)(x).size()
#define pb push_back
#define st first
#define nd second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define memo(x) memset(x, 0, sizeof(x))
#define debug(x) cerr << x << " "
#define PI 3.14159265359

LL losuj(LL a, LL b){ 
	return a+rng()%(b-a+1);
}

const int INF = 1e9+7;

void setIO(string s) {
	freopen((s + ".in").c_str(), "r", stdin);
	freopen((s + ".out").c_str(), "w", stdout);
}

typedef vector<int> vvv;

map<vvv, int>dist;
queue<vvv>q;
vi a(3), b(3), ans;

void bfs(){
	while (!q.empty()){
		vvv curr = q.front(); q.pop();
		rep(i, 0, 3) debug(curr[i]);
		cerr << "\n";
		rep(i, 0, 3){
			rep(j, 0, 3){
				if (i == j) continue;
				//z i do j
				vvv next = curr;
				if (curr[j] + curr[i] <= a[j]){
					next[i] = 0;
					next[j] = curr[j] + curr[i];
				} else {
					next[i] = curr[i]-(a[j]-curr[j]);
					next[j] = a[j];
				}
				if (dist.find(next) == dist.end()){
					dist[next] = dist[curr]+1;
					rep(k, 0, 3){
						ans[next[k]] = min(ans[next[k]], dist[next]);
					}
					q.push(next);
				}
			}
		}
	}
}

void solve(){
	rep(i, 0, 3) cin >> a[i];
	rep(i, 0, 3) cin >> b[i];
	ans.assign(a[2]+1, INF);
	rep(i, 0, 3) ans[b[i]] = 0;
	q.push(b);
	dist[q.front()] = 0;
	bfs();
	rep(i, 0, sz(ans)){
		if (ans[i] == INF) cout << "-1 ";
		else cout << ans[i] << " ";
	}
	cout << "\n";
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = 1;
	//cin >> t;
	while (t--) solve();
	
	return 0;
}