#!/usr/bin/env python3

def binsearch(l, r, pred): # [l, r)
    assert l <= r
    l -= 1
    while r - l > 1:
        m = (l + r) // 2
        if pred(m):
            r = m
        else:
            l = m
    return r

def ceildiv(x, y):
    return (x + y - 1) // y

def main():
    p, q, r = map(int, input().split())
    a, b, c = map(int, input().split())

    l0 = 0
    r0 = 10 ** 19
    l1 = binsearch(l0, r0, lambda n: ceildiv(n, p) >= a)
    r1 = binsearch(l1, r0, lambda n: ceildiv(n, p) >  a)
    l2 = binsearch(l1, r1, lambda n: ceildiv(n, q) >= a + b)
    r2 = binsearch(l2, r1, lambda n: ceildiv(n, q) >  a + b)
    l3 = binsearch(l2, r2, lambda n: ceildiv(n, r) >= a + b + c)
    r3 = binsearch(l3, r2, lambda n: ceildiv(n, r) >  a + b + c)

    if l3 < r3:
        print(l3, r3 - 1)
    else:
        print(-1)

main()