/* -*- coding: utf-8 -*-
 *
 * 1935.cc:  No.1935 Water Simulation - yukicoder
 */

#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
 
using namespace std;

/* constant */

const int K = 4;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef map<int,int> mii;

/* global variables */

/* subroutines */

int v2bits(int v[]) {
  int bits = 0;
  for (int i = 0; i < K; i++)
    bits |= v[i] << (i * 8);
  return bits;
}

void bits2v(int bits, int v[]) {
  for (int i = 0; i < K; i++)
    v[i] = (bits >> (i * 8)) & 0xff;
}

void printv(int vs[]) {
  for (int i = 0; i < K; i++) printf("%d ", vs[i]);
}

/* main */

int main() {
  int vs[K];
  for (int i = 0; i < K; i++) scanf("%d", vs + i);

  ll n;
  scanf("%lld", &n);

  int xs[K];
  fill(xs, xs + K, 0);
  xs[0] = vs[0];

  vi bs;
  mii cache;
  int l = 0, r = 0, b0 = v2bits(xs);
  bs.push_back(b0);
  cache[b0] = 0;
  //printv(xs), printf(": %d\n", l);

  for (;;) {
    int i = l % K;
    int j = (i + 1) % K;
    int d = min(xs[i], vs[j] - xs[j]);
    xs[i] -= d, xs[j] += d;
    l++;
    //printv(xs), printf(": %d\n", l);

    int bits = v2bits(xs);
    mii::iterator mit = cache.find(bits);
    if (mit != cache.end()) {
      r = mit->second;
      break;
    }

    bs.push_back(bits);
    cache[bits] = l;
  }
  //printf("r=%d, l=%d\n", r, l);

  int b = (n < r) ? bs[n] : bs[r + (n - r) % (l - r)];
  bits2v(b, xs);
  for (int i = 0; i < K; i++)
    printf("%d%c", xs[i], (i + 1 < K) ? ' ' : '\n');
  return 0;
}