import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { int[4] V; foreach (i; 0 .. 4) { V[i] = readInt; } const N = readLong; int[4] xs; xs[0] = V[0]; void oper(int s) { const s1 = (s + 1) & 3; const t = min(xs[s], V[s1] - xs[s1]); xs[s] -= t; xs[s1] += t; } void doIt(long n) { int[4][] xss; auto app = new int[][][][](V[0] + 1, V[1] + 1, V[2] + 1, V[3] + 1); foreach (i; 0 .. n) { const j = app[xs[0]][xs[1]][xs[2]][xs[3]] - 1; if (j >= 0) { xs = xss[cast(int)(j + (n - j) % (i - j))]; break; } debug { writeln(i, " ", xs); } xss ~= xs; app[xs[0]][xs[1]][xs[2]][xs[3]] = cast(int)(i + 1); foreach (s; 0 .. 4) { oper(s); } } } doIt(N / 4); foreach (i; 0 .. N % 4) { oper(cast(int)(i)); } writeln(xs[0], " ", xs[1], " ", xs[2], " ", xs[3]); } } catch (EOFException e) { } }