#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
#define ALLR(v) (v).rbegin(),(v).rend()
#define fi first
#define se second
#define PB push_back
#define EB emplace_back
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j]<<" \n"[j==w-1];}};
template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cout<<v[i]<<" \n"[i==n-1];};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
// const int mod=1e9+7;
const int mod=998244353;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> v(4);
    REP(i,4) cin >> v[i];
    int sv=0;
    REP(i,4) sv+=v[i];
    ll n;cin >> n;

    vector nx(v[0]+1,vector(v[1]+1,vector<array<int,3>>(v[2]+1)));
    REP(i,v[0]+1) REP(j,v[1]+1) REP(k,v[2]+1){
        int l=v[0]-i-j-k;
        if(l<0) continue;
        array<int,4> nv={i,j,k,l};
        REP(x,4){
            int d=clamp(v[(x+1)%4]-nv[(x+1)%4],0,nv[x]);
            nv[x]-=d;
            nv[(x+1)%4]+=d;
        }
        nx[i][j][k]={nv[0],nv[1],nv[2]};
        // cerr << i << " " << j << " " << k << " " << l << endl;
        // cerr << nv[0] << " " << nv[1] << " " << nv[2] << " " << v[0]-nv[0]-nv[1]-nv[2] << endl;
        // cerr << endl;
    }
    int lgn=pophigh(n);
    vector db(lgn+1,vector(v[0]+1,vector(v[1]+1,vector<array<int,3>>(v[2]+1))));
    REP(i,v[0]+1) REP(j,v[1]+1) REP(k,v[2]+1){
        if(i+j+k>v[0]) continue;
        db[0][i][j][k]=nx[i][j][k];
    }
    REP(x,lgn){
        REP(i,v[0]+1) REP(j,v[1]+1) REP(k,v[2]+1){
            if(i+j+k>v[0]) continue;
            array<int,3> t=db[x][i][j][k];
            db[x+1][i][j][k]=db[x][t[0]][t[1]][t[2]];
        }
    }
    ll nn=n/4;
    array<int,3> now={v[0],0,0};
    REP(bit,lgn+1){
        array<int,3> nxt;
        // cerr << nn << " " << bit << endl;
        if(nn&(1LL<<bit)){
            nxt=db[bit][now[0]][now[1]][now[2]];
            swap(nxt,now);
        }
        // cout << now[0] << " " << now[1] << " " << now[2] << " " << v[0]-now[0]-now[1]-now[2] << endl;
    }
    array<int,4> ans{now[0],now[1],now[2],v[0]-now[0]-now[1]-now[2]};
    REP(x,n%4){
        int d=min(ans[x],v[(x+1)%4]-ans[(x+1)%4]);
        ans[x]-=d;
        ans[(x+1)%4]+=d;
    }
    cout << ans[0] << " " << ans[1] << " " << ans[2] << " " << v[0]-ans[0]-ans[1]-ans[2] << endl;
}