#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using namespace std;
using ll=long long;

ll num[4][1010][1010];
ll sum[4][1010];

int main(void){
	ll d[3],p[3],n;
	rep(i,3) cin >> d[i];
	rep(i,3) cin >> p[i];
	cin >> n;

	num[0][0][0]=1LL;

	rep(cur,3){
		const int nxt=cur+1;
		
		rep(i,1,n) rep(j,n) num[cur][i][(j+1)%n]=num[cur][i-1][j];
		rep(i,n)rep(j,n) sum[cur][j]+=num[cur][i][j];

		ll l=p[cur],r=d[cur]-1-p[cur];

		rep(j,n) num[nxt][0][j]+=(l/n+r/n)*sum[cur][j];
		rep(i,l%n+1)rep(j,n) num[nxt][0][j]+=num[cur][i][j];
		rep(i,r%n+1)rep(j,n) num[nxt][0][j]+=num[cur][i][j];
		rep(j,n) num[nxt][0][j]-=num[cur][0][j];
	}

	rep(i,n) cout << (i?" ":"") << num[3][0][i];
	cout << endl;
	return 0;
}