//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/debug.hpp"
#include "./CompetitiveProgrammingCpp/Timer.hpp"
#include "./CompetitiveProgrammingCpp/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
auto pow(signed, signed) { assert(false); }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;

//=============================================================================================

auto solve(ll n, const VL& v) {
    using T = std::tuple<VL, ll>;
    map<T, ll> mp;
    VVL ans; ans.reserve(1e7);
    VL now(4); now[0] = v[0];
    ll c = 0;
    ll k = 0;
    while(mp.find(T{now,k}) == mp.end()) {
        mp.emplace(T{now,k}, c);
        ans.emplace_back(now);
        ll t = (k + 1) % 4;
        ll d = std::min(now[k], v[t] - now[t]);
        now[k] -= d;
        now[t] += d;

        ++c;
        k = (k + 1) % 4;
        if(c == n) { return now; }
    }

    ll begin = mp[T{now,k}];
    ll len = c - begin;
    return ans[begin + (n - begin) % len];
}

auto solve_c(ll n, const VL& v) {

    VL now(4); now[0] = v[0];
    ll c = 0;
    ll k = 0;
    while(true) {
        ll t = (k + 1) % 4;
        ll d = std::min(now[k], v[t] - now[t]);
        now[k] -= d;
        now[t] += d;

        k = (k + 1) % 4;
        ++c;
        if(c == n) { return now; }
    }

}
signed main() {
    /**/
    VL v(4);
    cin >> v;
    ll n;
    cin >> n;

    auto ans = solve(n, v);
    REPC(x, ans) {
        cout << x << " ";
    }BR();
    /*/

    auto tm = Timer::SimpleTimer();
    auto gen = Sample::SampleGenerator();
    REP(_, 100) {
        auto [n, v] = gen.generate(PAIR{1,10},
                                   V<PAIR>(4, PAIR{1,10}));

        auto ans = solve(n, v);
        auto ans_c = solve_c(n, v);
        if(ans != ans_c) {
            REPC(x, v) { cout << x << " "; }
            cout << n << endl;
            dump(ans, ans_c);
            return 0;
        }
    }
    tm.print();

    /**/

}