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

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

int kth_vertex(vector<int> &a, long long K, int s) {
    // K <= 10^18
    int LOG = 60;
    int N = (int)a.size();
    vector<vector<int>> db(LOG, vector<int>(N));
    db[0] = a;
    for (int k = 0; k < LOG - 1; k++) {
        for (int i = 0; i < N; i++) {
            db[k + 1][i] = db[k][db[k][i]];
        }
    }
    for (int k = 0; k < LOG; k++) {
        if (K >> k & 1) {
            s = db[k][s];
        }
    }
    return s;
}

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    V<int> A(4);
    rep(i, 4) cin >> A[i];
    ll N;
    cin >> N;
    map<V<int>, int> id;
    V<int> B = {A[0], 0, 0, 0, 0};
    int Nc = 0;
    id[B] = Nc++;
    while (1) {
        int pre = B[4] % 4, nex = (B[4] + 1) % 4;
        int t = min(B[pre], A[nex] - B[nex]);
        B[pre] -= t;
        B[nex] += t;
        B[4] = (B[4] + 1) % 4;
        if (id.count(B)) break;
        id[B] = Nc;
        Nc++;
    }
    V<V<int>> db(60, V<int>(Nc, -1));
    V<int> C(Nc);
    for (auto &[Bi, c] : id) {
        auto B = Bi;
        int pre = B[4] % 4, nex = (B[4] + 1) % 4;
        int t = min(B[pre], A[nex] - B[nex]);
        B[pre] -= t;
        B[nex] += t;
        B[4] = (B[4] + 1) % 4;
        C[c] = id[B];
    }
    auto ans = kth_vertex(C, N, 0);
    for (auto &[B, c] : id) {
        if (c == ans) {
            cout << B[0] << ' ' << B[1] << ' ' << B[2] << ' ' << B[3] << '\n';
        }
    }
    return 0;
}