#include using namespace std; typedef long long ll; typedef pair lpair; const ll MOD = 1e9 + 7; const ll INF = 1e18; #define rep(i,m,n) for(ll i = (m); i < (n); i++) #define rrep(i,m,n) for(ll i = (m); i >= (n); i--) #define print(x) cout << (x) << endl; #define print2(x,y) cout << (x) << " " << (y) << endl; #define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout<> P >> Q >> R; cin >> A >> B >> C; B += A; C += B; ll v1 = (A-1) * P + 1; ll v2 = A * P; ll v3 = (B-1) * Q + 1; ll v4 = B * Q; ll v5 = (C-1) * R + 1; ll v6 = C * R; ll min_val = max(v1,max(v3,v5)); ll max_val = min(v2,min(v4,v6)); if(min_val > max_val){ print(-1); }else{ cout << min_val << " " << max_val << endl; } }