#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;

int main() {
    ll p[3],a[3];
    for (int i = 0; i < 3; i++) cin >> p[i];
    for (int i = 0; i < 3; i++) {
        cin >> a[i];
        if (i) a[i] += a[i - 1];
    }

    ll mx = 3e18, mn = 0;
    for (int i = 0; i < 3; i++) {
        mx = min(mx, p[i] * a[i]);
        mn = max(mn, p[i] * (a[i] - 1) + 1);
    }

    if (mx < mn) cout << -1 << endl;
    else {
        cout << mn << " " << mx << endl;
    }
}