import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
#n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
n = a.pop()
t = b.pop()
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
se = set()
m = 40001
for i in range(a[0]+1):
    for j in range(a[1]+1):
        cnt = i+j
        ti = i * b[0] + j * b[1]
        if ti > t:
            continue
        se.add(ti * m + cnt)
cnt3,ti3 = 0,0
a1,a2 = 0,0
for i in range(a[2]+1):
    for j in range(a[3]+1):
        cnt = i+j
        ti = i * b[2] + j * b[3]
        if ti > t:
            continue
        cnt2 = n - cnt
        ti2 = t - ti
        if cnt2 < 0:
            continue
        if ti2 < 0:
            continue
        if ti2 * m + cnt2 in se:
            ti3 = ti
            cnt3 = cnt
            a1,a2 = i,j
            break
for i in range(a[0]+1):
    for j in range(a[1]+1):
        cnt = i+j
        ti = i * b[0] + j * b[1]
        if cnt + cnt3 == n and ti + ti3 == t:
            exit(print(i,j,a1,a2))