#include<map>
#include<iostream>
#include<deque>
#include<algorithm>
#include<string>
#include<cctype>
#include<iomanip>
#include<vector>
#include<queue>
#include<tuple>
#include<stdio.h>
 
using namespace std;
#define REP(i,b,e) for(ll i=(ll)b;i<(ll)e;i++)
#define rep0(i,n) REP(i,0ll,n)
#define rep1(i,n) REP(i,1ll,n+1)
 
#define shosu setprecision(10)
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> Q;
typedef pair<Q,ll> R;
ll longinf=1ll<<60;
int inf=1<<29;
//mleしなければぜんぶllでかく。

int main(){
	ll p,q,r,a,b,c;
	cin>>p>>q>>r>>a>>b>>c;
	c=a+b+c;
	b=a+b;
	ll minN=max({p*(a-1),q*(b-1),r*(c-1)})+1;
	ll maxN=min({p*a,q*b,r*c});
	if(minN<=maxN){
		cout<<minN<<" "<<maxN<<endl;
	}
	else{
		cout<<-1<<endl;
	}
	return 0;
}