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

using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VVVVI = vector<VVVI>;
using VVVVVI = vector<VVVVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VB = vector<bool>;
using VVB = vector<VB>;
using P = pair<int, int>;
using VP = vector<P>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    VI V(4);
    REP(i, 4) cin >> V[i];
    ll N;
    cin >> N;
    map<VI, int> A;
    //A[{V[0], 0, 0, 0}] = 0;
    VVI B(1, VI(4, 0));
    B[0][0] = V[0];
    int L, R;
    REP(i, 100000000) {
        B.push_back(B.back());
        int M = min(V[(i + 1) % 4] - B[i][(i + 1) % 4], B[i][i % 4]);
        B[i + 1][i % 4] -= M;
        B[i + 1][(i + 1) % 4] += M;
        if (A.find(B[i + 1]) != A.end()) {
            L = A[B[i + 1]];
            R = i + 1;
            break;
        }
        A[B[i + 1]] = i + 1;
        if (i + 1 == N) {
            REP(j, 4) {
                cout << B[N][j];
                if (j < 3) cout << " ";
            }
            cout << endl;
            return 0;
        }
    }
    REP(i, 4) {
        cout << B[L + (N - L) % (R - L)][i];
        if (i < 3) cout << " ";
    }
    cout << endl;
}