#include <stdio.h>

int main()
{
	int V[4];
	long long N;
	scanf("%d %d %d %d %lld", &(V[0]), &(V[1]), &(V[2]), &(V[3]), &N);
	
	int i, j, k, v[4] = {V[0], 0, 0, 0}, flag[4][101][101][101] = {}, q[4000001][4];
	flag[0][0][0][0] = 1;
	q[0][0] = 0;
	q[0][1] = v[1];
	q[0][2] = v[2];
	q[0][3] = v[3];
	for (i = 1, j = 0, k = 1; i <= N; i++, j++, k++) {
		if (j == 4) j = 0;
		if (k == 4) k = 0;
		if (v[j] <= V[k] - v[k]) {
			v[k] += v[j];
			v[j] = 0;
		} else {
			v[j] -= V[k] - v[k];
			v[k] = V[k];
		}
		if (flag[k][v[1]][v[2]][v[3]] == 0) {
			flag[k][v[1]][v[2]][v[3]] = i + 1;
			q[i][0] = k;
			q[i][1] = v[1];
			q[i][2] = v[2];
			q[i][3] = v[3];
		} else break;
	}
	if (i <= N) {
		j = i + 1 - flag[k][v[1]][v[2]][v[3]];
		i = flag[k][v[1]][v[2]][v[3]] - 1;
		k = (N - i) % j;
		v[1] = q[i+k][1];
		v[2] = q[i+k][2];
		v[3] = q[i+k][3];
	}
	printf("%d %d %d %d\n", V[0] - v[1] - v[2] - v[3], v[1], v[2], v[3]);
	fflush(stdout);
	return 0;
}