#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
namespace my{
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define VL(n,...) vec<ll>__VA_ARGS__;setsize({n},__VA_ARGS__);lin(__VA_ARGS__)
#define FO(n) for(ll ij=n;ij-->0;)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;return r;}
constexpr char newline=10;
constexpr char space=32;
constexpr ll digit_num10(auto x){x|=1;ll r=0;while(x>0)x/=10,++r;return r;}
auto min(const auto&...a){return min(initializer_list<common_type_t<decltype(a)...>>{a...});}

template<class A,class B>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  pair(const std::pair<A,B>&p):a(p.first),b(p.second){}
  auto operator<=>(const pair&)const=default;
  pair operator+(const pair&p)const{return{a+p.a,b+p.b};}
  friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<space<<p.b;}
};

template<class T,class U>ostream&operator<<(ostream&o,const std::pair<T,U>&p){return o<<p.first<<space<<p.second;}
template<class T,class U>ostream&operator<<(ostream&o,const unordered_map<T,U>&m){fe(m,e)o<<e.first<<space<<e.second<<newline;return o;}

template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;
template<class T>struct vec_attr{using core_type=T;static constexpr int d=0;};
template<vectorial V>struct vec_attr<V>{using core_type=typename vec_attr<typename V::value_type>::core_type;static constexpr int d=vec_attr<typename V::value_type>::d+1;};
template<class T>using core_t=vec_attr<T>::core_type;
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?newline:space);return o;}

template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){vector<V>::operator=(v);}

  vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  vec operator^(const vec&u)const{return vec{*this}^=u;}
  vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}
  vec operator+(const vec&u)const{return vec{*this}+=u;}
  vec operator-(const vec&u)const{return vec{*this}-=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
  vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}

  auto scan(const auto&f)const{pair<core_t<V>,bool>r{};fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}
  auto min()const{return scan([](auto&a,const auto&b){a>b?a=b:0;;}).a;}
  vec zeta()const{vec v=*this;if constexpr(vectorial<V>)fe(v,e)e=e.zeta();fo(i,v.size()-1)v[i+1]+=v[i];return v;}
};
template<class T=ll,size_t n,size_t i=0>auto make_vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1>(s,x);return vec<decltype(X)>(s[i],X);}}
template<ll n,class...A>void setsize(const ll(&l)[n],A&...a){((a=make_vec(l,core_t<A>())),...);}

template<bool is_negative=false>struct infinity{
  template<integral T>constexpr operator T()const{return numeric_limits<T>::max()*(1-is_negative*2);}
  template<floating_point T>constexpr operator T()const{return static_cast<ll>(*this);}
  template<class T>constexpr bool operator==(T x)const{return static_cast<T>(*this)==x;}
  constexpr auto operator-()const{return infinity<!is_negative>();}
};
constexpr infinity oo;

void lin(auto&...a){(cin>>...>>a);}
template<char c=space>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<newline;}

namespace sgt{
template<class T,auto x=T{}>T sgt_e(){return x;}
template<class T>T sgt_max(T a,T b){return b<a?a:b;}

template<class T>struct segmax:atcoder::segtree<T,sgt_max<T>,sgt_e<T,-oo>>{
  using atcoder::segtree<T,sgt_max<T>,sgt_e<T,-oo>>::segtree;
};
}

template<class T>struct eventually_periodic_vec:vec<T>{
  T period;
  T pre_period;
  sgt::segmax<T>sum_max;
  sgt::segmax<T>sum_min;
  eventually_periodic_vec()=default;
  eventually_periodic_vec(const vec<T>&v):pre_period(0),period(v.size()){fe(v,e)this->eb(e);build_sum();}
  eventually_periodic_vec(T a,const auto&f){
    unordered_map<T,ll>pre;
    T cu=a;
    period=-1;
    for(ll i=0;;++i){
      if(pre.contains(cu)){
        period=i-pre[cu];
        break;
      }
      pre[cu]=i;
      this->eb(cu);
      cu=f(cu);
    }
    pre_period=(T)this->size()-period;
    build_sum();
  }

  void build_sum(){
    auto zeta=this->zeta();
    sum_max=decltype(sum_max)(zeta);
    sum_min=decltype(sum_min)(zeta);
  }

  ll index(ll i)const{return i<pre_period?i:pre_period+periodic_index(i);}
  ll periodic_index(ll i)const{return(i-pre_period)%period;}
  T operator[](ll i)const{return vec<T>::operator[](index(i));}
  T&operator[](ll i){return vec<T>::operator[](index(i));}
};

template<class T>struct pow_linear:vec<T>{pow_linear(ll a,ll n):vec<T>(n+1,1){fo(i,n)(*this)[i+1]=(*this)[i]*a;}};

template<class T>struct pow10_linear:pow_linear<T>{
  vec<T>repunit_table;
  pow10_linear(ll n):pow_linear<T>(10,n),repunit_table(n+1){fo(i,n)repunit_table[i+1]=repunit_table[i]*10+1;}
};

ll pow10ll(ll n){static const auto v=pow10_linear<ll>(digit_num10(static_cast<ll>(oo)));return v[n];}

ll slice10ll(ll x,ll l,ll r){return x%pow10ll(r)/pow10ll(l);}

single_testcase
void solve(){
  ll N=4;
  VL(N,a);
  LL(K);

  ll start=a[0];

  auto f=[&](ll cu){
    ll k=cu/pow10ll(N*3);
    ll nk=(k+1)%N;

    ll from=slice10ll(cu,k*3,(k+1)*3);
    ll to=slice10ll(cu,nk*3,(nk+1)*3);

    ll move=min(from,a[nk]-to);
    ll nto=move+to;
    ll nfrom=from-move;

    ll nx=cu;

    nx-=from*pow10ll(k*3);
    nx+=nfrom*pow10ll(k*3);

    nx-=to*pow10ll(nk*3);
    nx+=nto*pow10ll(nk*3);

    nx-=k*pow10ll(N*3);
    nx+=nk*pow10ll(N*3);

    return nx;
  };

  eventually_periodic_vec<ll>ev(start,f);
  auto goal=ev[K];

  vec<ll>res(N);
  fo(i,N)res[i]=slice10ll(goal,i*3,(i+1)*3);
  pp(res);
}}