#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

int main(){
    VI v(4); REP(i,4) cin >> v[i];
    ll n; cin >> n;
    VI a(4,0); a[0]=v[0];
    REP(t,min((ll)400,n/4)){
        REP(i,4){
            a[(i+1)%4]+=a[i];
            a[i]=0;
            a[i]+=max((ll)0,a[(i+1)%4]-v[(i+1)%4]);
            chmin(a[(i+1)%4],v[(i+1)%4]);
        }
    }
    REP(i,n%4){
        a[(i+1)%4]+=a[i];
        a[i]=0;
        a[i]+=max((ll)0,a[(i+1)%4]-v[(i+1)%4]);
        chmin(a[(i+1)%4],v[(i+1)%4]);
    }
    REP(i,4) cout << a[i] << " \n"[i==3];
    return 0;
}