#include <bits/stdc++.h>

const int N = 1e6 + 50;

int64_t id(int64_t A, int64_t B, int64_t C) {
	return (A << 40) | (B << 20) | C;
}

int f[N];
std::set<int64_t> visited;
std::queue<std::tuple<std::array<int64_t, 3>, int>> que;
std::array<int64_t, 3> lim, cur;

void update(int x, int y) {
	f[x] = std::min(f[x], y);
}

void transfer(auto o, int64_t d) {
	int64_t i = id(o[0], o[1], o[2]);
	if (!visited.count(i)) {
		visited.emplace(i);
		que.emplace(o, d);
	}
}

int main() {
	std::cin >> lim[0] >> lim[1] >> lim[2] >> cur[0] >> cur[1] >> cur[2];
	memset(f, 0x3f, sizeof f);
	que.emplace(cur, 0);
	while (!que.empty()) {
		auto [o, d] = que.front(); que.pop();
		update(o[0], d), update(o[1], d), update(o[2], d);
		for (int i = 0; i < 3; ++i)
			for (int j = 0; j < 3; ++j) {
				auto p = o;
				int64_t size = std::min(p[i], lim[j] - p[j]);
				p[i] -= size; p[j] += size;
				transfer(p, d + 1);
			}
	}
	for (int i = 0; i <= lim[2]; ++i) {
		if (f[i] >= 0x3f3f3f3f) f[i] = -1;
		printf("%d ", f[i]);
	}
}