#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int v1, v2, v3, v4; cin >> v1 >> v2 >> v3 >> v4;
	long long n; cin >> n;
	map< array<int, 4>, int>mp;
	vector<array<int, 4>>v;
	int n1 = v1, n2 = 0, n3 = 0, n4 = 0;
	if (0 == n % 4) {
		mp[{v1, 0, 0, 0}] = 0;
		v.push_back({ n1, n2, n3, n4 });
	}
	long long st, ed;
	for (int i = 1;; ++i) {
		if (1 == i % 4) {
			int diff = min(n1, v2 - n2);
			n1 -= diff;
			n2 += diff;
		}
		else if (2 == i % 4) {
			int diff = min(n2, v3 - n3);
			n2 -= diff;
			n3 += diff;
		}
		else if (3 == i % 4) {
			int diff = min(n3, v4 - n4);
			n3 -= diff;
			n4 += diff;
		}
		else {
			int diff = min(n4, v1 - n1);
			n4 -= diff;
			n1 += diff;
		}
		if (n % 4 == i % 4) {
			//cout << i << endl;
			//cout << n1 << " " << n2 << " " << n3 << " " << n4 << endl;
			if (mp.count({ n1, n2, n3, n4 })) {
				st = mp[{ n1, n2, n3, n4 }];
				ed = mp.size();
				break;
			}
			mp[{ n1, n2, n3, n4 }] = mp.size();
			v.push_back({ n1, n2, n3, n4 });
		}
	}
	//cout << st << " " << ed << endl;
	n /= 4;
	if (n < ed) {
		rep(i, 4)cout << v[n][i] << " ";
	}
	else {
		long long x = st + (n - st) % (ed - st);
		rep(i, 4)cout << v[x][i] << " ";
	}
	return 0;
}