#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  ll P,Q,R; cin >> P >> Q >> R;
  ll A,B,C; cin >> A >> B >> C;
  B+=A;C+=B;
  ll l1=0,l2=1LL<<62;
  chmax(l1,P*A-P+1); chmin(l2,P*A+1);
  chmax(l1,Q*B-Q+1); chmin(l2,Q*B+1);
  chmax(l1,R*C-R+1); chmin(l2,R*C+1);
  if(l1>=l2) cout << -1 << endl;
  else cout << l1 << ' ' << l2-1 << endl;
  return 0;
}