#include "bits/stdc++.h"
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define put(a) cout<<a<<"\n"
#define all(a)  (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }

int main() {
	ll a, b, c, p, q, r;
	cin >> p >> q >> r >> a >> b >> c;
	ll min_n=LLONG_MIN, max_n=LLONG_MAX;
	vector<ll> x = { a,a + b,a + b + c };
	vector<ll> s = { p,q,r };
	REP(i, 3) {
		chmax(min_n, x[i] * s[i] - s[i] + 1);
		chmin(max_n, x[i] * s[i]);
	}
	if (min_n <= max_n) {
		cout << min_n << " " << max_n << endl;
	}
	else {
		put(-1);
	}
	return 0;
}