#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

#define int long long

void print(vector<int> v) {
    for(auto e : v) cout << e << " ";
    cout << "\n";
    return;
}

const int N = 110;
int when[N][N][N][4];

void solve() {
    rep(i, N) rep(j, N) rep(k, N) rep(l, 4) when[i][j][k][l] = -1;
    vector<int> v(4);
    FOR(4) cin >> v[i];
    int n;
    cin >> n;

    
    vi now = {v[0], 0, 0, 0};
    vvi states;
    int op = 0;
    int cnt = 0;
    while(true) {
        if(when[now[0]][now[1]][now[2]][op] != -1) {
            int wh = when[now[0]][now[1]][now[2]][op];
            n -= wh;
            int cycle = cnt - wh;

            int index = n % cycle;
            
            print(states[wh + index]);

            return;
        }else {
            when[now[0]][now[1]][now[2]][op] = cnt;
            states.push_back(now);
            int minus = min(now[op], v[(op+1)%4]-now[(op+1)%4]);
            now[op] -= minus;
            now[(op+1)%4] += minus;
            cnt++;
            op = (op + 1) % 4;
        }

        if(cnt == n) {
            print(now);
            return;
        }
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}