#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}


int main(){
  vl v(4);rep(i,4)cin >> v[i];
  map<vl,ll> mp;
  vl s(5);s[0]=v[0];
  mp[s]=0;
  ll n;cin >> n;
  ll flag=false;
  for(ll i=1;i<=n;i++){
    ll p=s[(i-1)%4];
    if(p+s[i%4]<=v[i%4]){
      s[(i-1)%4]=0;
      s[i%4]+=p;
    }
    else{
      ll q=v[i%4]-s[i%4];
      s[(i-1)%4]-=q;
      s[i%4]=v[i%4];
    }
    s[4]=i%4;
    //rep(j,4)cout << s[j] <<" ";cout << endl;
    //cout << accumulate(all(s),0LL) << endl;
    if(flag)continue;
    else if(flag==false&&mp.count(s)){
      flag=true;
      ll loop=i-mp[s];
      ll rem=(n-i)/loop;
      i+=rem*loop;
      //cout << i << endl;
    }
    else{
      mp[s]=i;
    }
  }
  rep(i,4)cout << s[i] <<" ";cout << endl;
}