#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
map<vector<ll>,ll> m[4];
vector<vector<ll>> v;

void Main() {
  vector<ll> b(4);
  ll n;
  rep(i,4) cin >> b[i];
  cin >> n;
  vector<ll> a=b;
  REP(i,1,4) a[i]=0;
  m[0][a]=0;
  v.pb(a);
  ll t=0,k=1;
  while(n) {
    ll r=(t+1)%4;
    ll d=min(a[t],b[r]-a[r]);
    a[t]-=d;
    a[r]+=d;
    if(m[r].count(a)) {
      k-=m[r][a];
      n--;
      n%=k;
      vector<ll> ans=v[m[r][a]+n];
      PR(ans,4);
      return;
    }
    m[r][a]=k;
    v.pb(a);
    t=(t+1)%4;
    n--;
    k++;
  }
  PR(a,4);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}