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

int main(){
  vector<long long int> Vol(4);
  long long int N;
  for(int i=0;i<4;i++) cin >> Vol[i];
  cin >> N;
  vector<vector<long long int>> vec(1,vector<long long int>(5));
  vec[0][0] = Vol[0];
  for(int i=1;i<4;i++) vec[0][i] = 0;
  vec[0][4] = 0;
  map<vector<long long int>,bool> Map;
  Map[vec[0]] = true;
  vector<long long int> same;
  bool ok = false;
  for(long long int i=1;;i++){
    vector<long long int> V = vec.back();
    vector<long long int> NV(4);
    long long int t = (i-1)%4;
    long long int u = t+1;
    u %= 4;
    if(V[u]+V[t] <= Vol[u]){
      NV[u] = V[u]+V[t];
      NV[t] = 0;
    }
    else{
      NV[t] = V[t]-(Vol[u]-V[u]);
      NV[u] = Vol[u];
    }
    for(int j=0;j<4;j++){
      if(j != t && j != u){
        NV[j] = V[j];
      }
    }
    NV.push_back(u);
    V = NV;
    if(i == N){
      cout << V[0];
      for(int j=1;j<4;j++) cout << " " << V[j];
      cout << endl;
      ok = true;
      break;
    }
    if(Map[V]){
      same = V;
      break;
    }
    Map[V] = true;
    vec.push_back(V);
  }
  if(!ok){
    long long int t;
    for(long long int i=0;i<vec.size();i++) if(vec[i] == same) t = i;
    N -= t;
    reverse(vec.begin(),vec.end());
    for(long long int i=0;i<t;i++) vec.pop_back();
    reverse(vec.begin(),vec.end());
    long long int S = vec.size();
    N %= S;
    cout << vec[N][0];
    for(int i=1;i<4;i++) cout << " " << vec[N][i];
    cout << endl;
  }
}