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
#include <iostream>
#include <map>
#include <queue>
#define ll long long int
#define _a .first
#define _b .second.first
#define _c .second.second
#define _but .first
#define _v .second
#define f_a qf _but _a
#define f_b qf _but _b
#define f_c qf _but _c
#define f_v qf _v
#define t_a t _but _a
#define t_b t _but _b
#define t_c t _but _c
#define t_v t _v
using namespace std;

map<pair<int, pair<int, int>>, bool> odw;
ll w[100001];
ll ma, mb, mc;
int a, b, c;
queue<pair<pair<int, pair<int, int>>, ll>> q;
pair<pair<int, pair<int, int>>, ll> qf;
pair<pair<int, pair<int, int>>, ll> t;

void bfs() {
	while (!q.empty()) {
		qf = q.front();
		q.pop();

		t_v = f_v + 1;

		//update w
		w[f_a] = min(w[f_a], f_v);
		w[f_b] = min(w[f_b], f_v);
		w[f_c] = min(w[f_c], f_v);

		//a -> b
		if (f_a + f_b >= mb) {
			t_a = f_a - (mb - f_b);
			t_b = mb;
			t_c = f_c;
		}
		else {
			t_a = 0;
			t_b = f_a + f_b;
			t_c = f_c;
		}
		if (!odw[t _but]) {
			odw[t _but] = true;
			q.push(t);
		}

		//a -> c
		if (f_a + f_c >= mc) {
			t_a = f_a - (mc - f_c);
			t_b = f_b;
			t_c = mc;
		}
		else {
			t_a = 0;
			t_b = f_b;
			t_c = f_a + f_c;
		}
		if (!odw[t _but]) {
			odw[t _but] = true;
			q.push(t);
		}

		//b -> c
		if (f_b + f_c >= mc) {
			t_a = f_a;
			t_b = f_b - (mc - f_c);
			t_c = mc;
		}
		else {
			t_a = f_a;
			t_b = 0;
			t_c = f_b + f_c;
		}
		if (!odw[t _but]) {
			odw[t _but] = true;
			q.push(t);
		}

		//b -> a
		if (f_b + f_a >= ma) {
			t_a = ma;
			t_b = f_b - (ma - f_a);
			t_c = f_c;
		}
		else {
			t_a = f_a + f_b;
			t_b = 0;
			t_c = f_c;
		}
		if (!odw[t _but]) {
			odw[t _but] = true;
			q.push(t);
		}

		//c -> a
		if (f_c + f_a >= ma) {
			t_a = ma;
			t_b = f_b;
			t_c = f_c - (ma - f_a);
		}
		else {
			t_a = f_a + f_c;
			t_b = f_b;
			t_c = 0;
		}
		if (!odw[t _but]) {
			odw[t _but] = true;
			q.push(t);
		}

		//c -> b
		if (f_c + f_b >= mb) {
			t_a = f_a;
			t_b = mb;
			t_c = f_c - (mb - f_b);
		}
		else {
			t_a = f_a;
			t_b = f_b + f_c;
			t_c = 0;
		}
		if (!odw[t _but]) {
			odw[t _but] = true;
			q.push(t);
		}
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> ma >> mb >> mc;
	cin >> a >> b >> c;

	for (int i = 0; i <= mc; ++i) {
		w[i] = 2000000000000000;
	}

	odw[{a, { b, c }}] = true;
	q.push({ {a, {b, c}}, 0 });

	bfs();

	for (int i = 0; i <= mc; ++i) {
		cout << ((w[i] == (ll)2000000000000000) ? -1 : w[i]) << " ";
	}
}