#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[101][101][101] = {}, q[2000001][3];
	flag[v[0]][0][0] = 1;
	q[0][0] = v[0];
	q[0][1] = v[1];
	q[0][2] = v[2];
	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[v[0]][v[1]][v[2]] == 0) {
			flag[v[0]][v[1]][v[2]] = i + 1;
			q[i][0] = v[0];
			q[i][1] = v[1];
			q[i][2] = v[2];
		} else break;
	}
	if (i <= N) {
		k = i + 1 - flag[v[0]][v[1]][v[2]];
		j = (N - flag[v[0]][v[1]][v[2]] + 1) % k;
		i = flag[v[0]][v[1]][v[2]] - 1;
		v[0] = q[i+j][0];
		v[1] = q[i+j][1];
		v[2] = q[i+j][2];
	}
	printf("%d %d %d %d\n", v[0], v[1], v[2], V[0] - v[0] - v[1] - v[2]);
	fflush(stdout);
	return 0;
}