#include <bits/stdc++.h>
#define int long long
using namespace std;

int X, Y, Z, A, B, C, N, ans[1005];

void cal(int x, int y, int z, int origin){
  
  int i = 0, j = 0;
  int cnt[1005] = {};
  int ori = origin % N;
  
  while(1){
    
    int len = min( y - i - 1, j ) + 1;
    
    cnt[ori] += len;
    
    ori = ( ori + 1 ) % N;
    
    if( j == x - 1 ){
      
      if( i == y - 1 ) break;
      else i++;
      
    }else j++;
    
  }
  
  for(int l=0;l<N;l++){
  
    for(int k=0;k<N;k++){
      
      int L = z - k;
      
      if( L <= 0 ) break;
      
      int target = ( l + k ) % N;
      
      ans[target] += ( L / N + ( L % N != 0 ) ) * cnt[l];
      
    }
    
  }
  
}

void check(int x, int y, int z, int origin){
  
  if( x <= 0 || y <= 0 || z <= 0 ) return;
  
  cal( x, y, z, origin );
  
}

signed main(){
  
  cin>>X>>Y>>Z>>A>>B>>C>>N;
  
  check( X - A, Y - B, Z - C, 0 );
  
  check( X - A, B, Z - C, 1 );
  
  check( A, B, Z - C, 2 );
  
  check( A, Y - B, Z - C, 1 );
  
  check( X - A, Y - B, C, 1 );
  
  check( X - A, B, C, 2 );
  
  check( A, B, C, 3 );
  
  check( A, Y - B, C, 2 );
  
  for(int i=0;i<N;i++){
    if(i) cout<<' ';
    cout<<ans[i];
  }
  
  cout<<endl;
  
  return 0;
}

