#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; --i)

using u = pair<vi, int>;
int main() {
    vi v(4);
    rep(i, 4) cin >> v[i];
    ll n;
    cin >> n;
    map<u, int> mp;
    vi w(4, 0);
    w[0] = v[0];
    int k = 0;
    vvi ret;
    while (!mp.count(u(w, k & 3))) {
        ret.push_back(w);
        mp[u(w, k & 3)] = k;
        int i = k & 3;
        int j = (i + 1) & 3;
        int m = min(w[i], v[j] - w[j]);
        w[i] -= m;
        w[j] += m;
        k++;
    }
    if (n >= k) {
        int l = mp[u(w, k & 3)];
        n = (n - l) % (k - l) + l;
    }
    rep(i, 4) cout << ret[n][i] << (i < 3 ? ' ' : '\n');

    return 0;
}