#include <bits/stdc++.h>
using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

 
int main() {
    int P,Q,R,A,B,C;
    cin >> P>>Q>>R>>A>>B>>C;
    B+=A,C+=B;
    LL N=P*A, y=0,x=N+20;
    for(LL i = 0;i<N+10;i++) {
        if(ceil(i/P)==A && ceil(i/Q)==B && ceil(i/R)==C) {
            x=min(x,i);
            y=max(y,i);
        }
    }
    if(y=0) cout << "-1" << endl;
    else cout << x << " " << y << endl;
    return 0;
}