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
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int INF=INT_MAX;
const int MAXN=100000+5;
const int P=100003;

int vol[3];

unordered_set<long long int> visited(MAXN*100);
int d[MAXN];
queue<pair<long long int, int>> q;

inline long long int encode(int *config) {
    return ((long long int)config[0]*P + (long long int)config[1])*P + (long long int)config[2];
}
int config[3];
int new_config[3];
inline void decode(long long int v) {
    config[2] = v%P;
    v=v/P;
    config[1] = v%P;
    config[0] = (int)(v/P);
}
int source[] = {0, 1, 0, 2, 1, 2};
int target[] = {1, 0, 2, 0, 2, 1};
int unchanged[] = {2, 2, 1, 1, 0, 0};

int main() {
    ios_base::sync_with_stdio(0);
    
    SI(vol[0]);
    SI(vol[1]);
    SI(vol[2]);
    SI(config[0]);
    SI(config[1]);
    SI(config[2]);
    REP(i, vol[2]+1) {
        d[i]=INT_MAX;
    }
    
    long long int cid = encode(config);
    visited.insert(cid);
    q.push(make_pair(cid, 0));
    while (!q.empty()) {
        pair<long long int, int> e = q.front();
        decode(e.first);
        d[config[0]] = min(e.second, d[config[0]]);
        d[config[1]] = min(e.second, d[config[1]]);
        d[config[2]] = min(e.second, d[config[2]]);
        
        REP(i, 6) {
            int transfer_size = min(vol[target[i]]-config[target[i]], config[source[i]]);
            new_config[source[i]] = config[source[i]] - transfer_size;
            new_config[target[i]] = config[target[i]] + transfer_size;
            new_config[unchanged[i]] = config[unchanged[i]];
//            assert(new_config[0]>=0 && new_config[0]<vol[0]);
//            assert(new_config[1]>=0 && new_config[1]<vol[1]);
//            assert(new_config[2]>=0 && new_config[2]<vol[2]);
            cid = encode(new_config);
            unordered_set<long long int>::iterator vit = visited.find(cid);
            if (vit == visited.end()) {
                visited.insert(cid);
                q.push(make_pair(cid, e.second+1));
            }
        }
        q.pop();
    }
    
    REP(i, vol[2]+1) {
        printf("%d ", d[i] == INT_MAX ? -1 : d[i]);
    }
    printf("\n");
    return 0;
}