#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#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--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll V1, V2, V3, V4, N;
    cin >> V1 >> V2 >> V3 >> V4 >> N;
    // V1, V2, V3 に入っている水量を状態にもつ
    vector<vector<vector<vector<ll>>>> num(
        101, vector<vector<vector<ll>>>(
                 101, vector<vector<ll>>(101, vector<ll>(4, -1))));
    num[V1][0][0][0] = 0;
    ll now_1 = V1;
    ll now_2 = 0;
    ll now_3 = 0;
    ll now_4 = 0;
    ll now_num = 0;
    vector<tuple<ll, ll, ll, ll, ll>> tp(0);
    tp.push_back(tuple<ll, ll, ll, ll, ll>(V1, 0, 0, 0, 0));
    while (true) {
        if (now_num == N) {
            cout << now_1 << " " << now_2 << " " << now_3 << " " << now_4
                 << endl;
            return 0;
        }
        if (now_num % 4 == 0) {
            ll rem_min = min(now_1, V2 - now_2);
            now_1 -= rem_min;
            now_2 += rem_min;
        } else if (now_num % 4 == 1) {
            ll rem_min = min(now_2, V3 - now_3);
            now_2 -= rem_min;
            now_3 += rem_min;
        } else if (now_num % 4 == 2) {
            ll rem_min = min(now_3, V4 - now_4);
            now_3 -= rem_min;
            now_4 += rem_min;
        } else {
            ll rem_min = min(now_4, V1 - now_1);
            now_4 -= rem_min;
            now_1 += rem_min;
        }
        now_num = (now_num + 1);
        tp.push_back(
            tuple<ll, ll, ll, ll, ll>(now_1, now_2, now_3, now_4, now_num % 4));
        if (num[now_1][now_2][now_3][now_num % 4] != -1) {
            ll start = num[now_1][now_2][now_3][now_num % 4];
            ll loop = now_num - start;
            ll rems = (N - start) % loop;

            ll g1, g2, g3, g4, e_num;
            tie(g1, g2, g3, g4, e_num) = tp[start + rems];
            cout << g1 << " " << g2 << " " << g3 << " " << g4 << endl;
            return 0;
        } else {
            num[now_1][now_2][now_3][now_num % 4] = now_num;
        }
    }
}