import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

aa = LI()
n = aa.pop()
pp = LI()
t = pp.pop()

p, q = pp[2], pp[3]
for x in range(aa[0]+1):
    for y in range(aa[1]+1):
        if n-x-y > aa[2]+aa[3]: continue
        s = x*pp[0]+y*pp[1]
        if x+y > n or s > t: break
        if p == q:
            if (t-s)%p: continue
            if (t-s)//p != n-x-y: continue
            # z+w=(t-s)/p
            # z+w=n-x-y
            d = n-x-y
            z = min(d, aa[2])
            w = d-z
            print(x, y, z, w)
            exit()
        else:
            # z = (-n q + q x + q y - s + t)/(p - q)
            # w = (n p - p x - p y + s - t)/(p - q) , p!=q
            if (-n*q+q*x+q*y-s+t)%(p-q): continue
            if (n*p-p*x-p*y+s-t)%(p-q): continue
            z = (-n*q+q*x+q*y-s+t)//(p-q)
            w = (n*p-p*x-p*y+s-t)//(p-q)
            if z < 0 or z > aa[2]: continue
            if w < 0 or w > aa[3]: continue
            print(x, y, z, w)
            exit()