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][] vss;
      vss ~= [-1, -1, -1, -1];
      auto app = new int[][][][](V[0] + 1, V[1] + 1, V[2] + 1, V[3] + 1);
      int[4] vs;
      vs[0] = V[0];
      foreach (i; 1 .. N + 1) {
        const j = app[vs[0]][vs[1]][vs[2]][vs[3]];
        if (j) {
          vs = vss[cast(int)(j + ((N + 1) - j) % (i - j))];
          break;
        }
        vss ~= vs;
        app[vs[0]][vs[1]][vs[2]][vs[3]] = cast(int)(i);
        auto ws = vs;
        const j0 = cast(int)((i - 1) & 3);
        const j1 = cast(int)(i & 3);
        ws[j1] = min(vs[j0] + vs[j1], V[j1]);
        ws[j0] = vs[j0] + vs[j1] - ws[j1];
        vs = ws;
        debug {
          writeln(i, " ", vs);
        }
      }
      
      writeln(vs[0], " ", vs[1], " ", vs[2], " ", vs[3]);
break;
    }
  } catch (EOFException e) {
  }
}