#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1000003 ;

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