import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

P,Q,R=map(int,readline().split())
A,B,C=map(int,readline().split())
X=max((A-1)*P+1,(A+B-1)*Q+1,(A+B+C-1)*R+1)
Y=min(A*P,(A+B)*Q,(A+B+C)*R)
if X<=Y:
    print(X,Y)
else:
    print(-1)