#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll a[3], b[3];
    rep(i,3)cin >> a[i];
    rep(i,3)cin >> b[i];
    b[2] = b[0] + b[1] + b[2];
    b[1] = b[0] + b[1];
    ll mi[3], ma[3];

    rep(i,3){
        ma[i] = a[i] * b[i];
        mi[i] = a[i] * (b[i] - 1) + 1;
    }

    ll ansma = min(ma[0],min(ma[1],ma[2]));
    ll ansmi = max(mi[0],max(mi[1],mi[2]));

    if(ansma < ansmi){
        cout << -1 << endl;
    }else{
        cout << ansmi << ' ' << ansma << endl;
    }

    return 0;
}