#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <list> 

using namespace std;

#define reps(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define rep(i, n) reps(i, 0, n)

#define ALL(x) x.begin(),x.end() 
#define SIZE(x) ll(x.size()) 

#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007 //問題による

#define F first
#define S second

#define coutALL(x) for(auto i=x.begin();i!=--x.end();i++)cout<<*i<<" ";cout<<*--x.end()<<endl;
#define coutALL2d(vv) for(const auto& v : vv){for(const auto& e : v){cout << e << " ";}cout << endl;}

#define vi vector<int>
#define vvi vector<vector<int> >
#define vll vector<long long>
#define vvll vector<vector<long long> >

int main(){
    long long n;
    vi v(4,0);
    cin >> v[0] >> v[1] >> v[2] >> v[3] >> n;
    int mn = 101;
    rep(i,4){
        mn = min({v[i],mn});
    }
    int cnt = 0;
    int count = 1;
    vi c(4, 0);
    c[0] = v[0];
    vvi r(4,vi(4));
    int idx = 0;
    int tmp = 0;
    int beftmp = 0;
    while(cnt <= 8){
        if(c[idx] >= v[(idx+1) % 4] - c[(idx+1) % 4]){
            tmp = v[(idx+1) % 4] - c[(idx+1) % 4];
            c[(idx+1) % 4] = v[(idx+1) % 4];
            c[idx] = c[idx] - tmp; 
        }
        else{
            tmp = c[idx];
            c[(idx+1) % 4] = c[(idx+1) % 4] + c[idx];
            c[idx] = 0;
        }
        
        if(beftmp == tmp){
            cnt++;
        }else{
            cnt = 0;
        }
        beftmp = tmp;
        idx = (idx+1)%4;

        if(cnt > 4){
            rep(i,4) r[count%4][i] = c[i];
        }
        if(count == n){
            coutALL(c);
            exit(0);
        }
        count++;
    }
    //coutALL2d(r);
    //cout << r[n%4] << endl;
    coutALL(r[n%4]);
}