import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def move(a,b,B):
    if a + b <= B:
        b += a
        a = 0
    else:
        a -= B - b
        b = B
    return a,b 

def main():
    V1,V2,V3,V4,N = map(int,input().split())
    dic = {}
    pre_state = (V1,0,0,0,0)
    L = []
    cnt = 0
    total = 0
    while True:
        #print(pre_state)
        L.append(pre_state)
        if pre_state in dic:
            start = dic[pre_state]
            end = total
            break
        dic[pre_state] = total
        if total == N:
            print(pre_state[:4]);exit()
        v1,v2,v3,v4,num = pre_state
        if num == 0:
            v1,v2 = move(v1,v2,V2)
        if num == 1:
            v2,v3 = move(v2,v3,V3)
        if num == 2:
            v3,v4 = move(v3,v4,V4)
        if num == 3:
            v4,v1 = move(v4,v1,V1)
        total += 1
        now_state = (v1,v2,v3,v4,total%4)
        pre_state = now_state
    #print("last",pre_state)
    #print(start,end)
    N -= start
    N %= (end - start)
    idx = N + start
    state = L[idx]
    print(*state[:4])

        
                
if __name__ == '__main__':
    main()