/*
MLE
*/
#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include<tuple>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;

typedef tuple<int,int,int,int> TP;
//typedef vector<int> TP;



int V1,V2,V3,V4;


vector<int> V(4);

/*
TP func(int t1,int t2,int t3,int t4,ll idx){

    TP res=make_tuple(t1,t2,t3,t4);
    if(idx==0){
        int u1=t1-min(V2-t2,t1);
        int u2=t2+min(V2-t2,t1);
        res=make_tuple(u1,u2,t3,t4);
    }
    else if(idx==1){
        int u2=t2-min(V3-t3,t2);
        int u3=t3+min(V3-t3,t2);
        res=make_tuple(t1,u2,u3,t4);
    }else if(idx==2){
        int u3=t3-min(V4-t4,t3);
        int u4=t4+min(V3-t3,t3);
        res=make_tuple(t1,t2,u3,t4);
    }else if(idx==3){
        int u4=t3-min(V1-t1,t3);
        int u1=t1+min(V1-t1,t3);
        res=make_tuple(u1,t2,t3,u4);

    }

    return res;
}
*/

vector<int> func(const vector<int>& t,int idx){

    vector<int> res(4);
    for(int i=0;i<4;i++){
        res[i]=t[i];
    }

    res[idx]=t[idx] - min(V[(idx+1)%4] - t[(idx+1)%4],t[idx]);
    res[(idx+1)%4]=t[(idx+1)%4] + min(V[(idx+1)%4] - t[(idx+1)%4],t[idx]);

    return res;
}


int main(){
    ll N;

    for(int i=0;i<4;i++){
        cin>>V[i];
    }
    cin>>N;

    vector<vector<int>> history;
    map<vector<int>,int> mp;



    auto now=vector<int>{V[0],0,0,0};

    int sz=0;

    int offset=-1;


    vector<vector<int>> cyclehistory;

    vector<int> ans;

    while(1){
        /*
        cout<<"sz="<<sz<<endl;
        for(int v:now){
            cout<<v<<' ';
        }
        cout<<endl;
        */
       if(sz==N) break;


       
        if(mp.count(now)){

            offset=mp[now];
            
            int cyclelen=sz-offset;

            now=history[(N-mp[now])%cyclelen+mp[now]];
            break;

        }else{
            mp[now]=sz;

            history.push_back(now);

            auto nx=func(now,sz%4);
            sz++;
            now=nx;
        }
        

     
    }

    
            for(int v:now){
                cout<<v<<' ';
            }
            cout<<endl;

            return 0;
        


}