#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int V[4];
ll N;

ll dp[4][101][101][101];


void solve() {
	int i,j,k,l,r,x,y;
	
	cin>>V[0]>>V[1]>>V[2]>>V[3]>>N;
	ll S=V[0];
	
	MINUS(dp);
	int C[4]={V[0],0,0,0};
	
	int s=0;
	while(N) {
		if(dp[s][C[0]][C[1]][C[2]]!=-1&&N>=10000000) {
			ll step=dp[s][C[0]][C[1]][C[2]]-N;
			N%=step;
			continue;
		}
		dp[s][C[0]][C[1]][C[2]]=N;
		x=min(C[s],V[(s+1)%4]-C[(s+1)%4]);
		C[s]-=x;
		C[(s+1)%4]+=x;
		s=(s+1)%4;
		N--;
		
	}
	cout<<C[0]<<" "<<C[1]<<" "<<C[2]<<" "<<C[3]<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}