#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools
mod=998244353

import sys
input=sys.stdin.readline
v1,v2,v3,v4,n=map(int,input().split())
d = defaultdict(lambda: -1)
cnt = 0
d[(v1,0,0,0,0)] = 0
n4=n2=n3=0;n1=v1
while cnt < n:
    m = cnt % 4
    if m == 0:
        dis = min(v2 - n2,n1)
        n1 -= dis
        n2 += dis
    elif m == 1:
        dis = min(v3-n3,n2)
        n2 -= dis
        n3 += dis
    elif m == 2:
        dis = min(v4 - n4,n3)
        n3 -= dis
        n4 += dis
    else:
        dis = min(v1-n1,n4)
        n4 -= dis
        n1 += dis
    cnt += 1
    m += 1
    m %= 4
    if d[(n1,n2,n3,n4,m)] == -1:
        d[(n1,n2,n3,n4,m)] = cnt
    else:
        loop = cnt - d[(n1,n2,n3,n4,m)]
        break
if cnt == n:
    print(n1,n2,n3,n4)
else:
    rem = d[(n1,n2,n3,n4,m)]
    p = (n - rem) % loop + rem
    for key,value in d.items():
        if value == p:
            print(*key[:-1])
            exit()