#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <numeric>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
#include <cassert>
#include <random>
#include <time.h>
//#include <boost/multiprecision/cpp_int.hpp>



using namespace std;
using Int = long long;
//using namespace boost::multiprecision;

const double EPS = 1e-10;
long long const MOD = 1000000007;

long long mod_pow(long long x, long long n) {
    long long res = 1;
    for (int i = 0;i < 60; i++) {
        if (n >> i & 1) res = res * x % MOD;
        x = x * x % MOD;
    }
    return res;
}

template<typename T>
T gcd(T a, T b) {
    return b != 0 ? gcd(b, a % b) : a;
}

template<typename T>
T lcm(T a, T b) {
    return a * b / gcd(a, b);
}

void fastInput() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

int main(void) {
    Int P, Q, R; cin >> P >> Q >> R;
    Int A, B, C; cin >> A >> B >> C;
    // N/P = A, N/P = A
    // N/Q - A = B, N/Q = A + B
    // N/R - A - B = C, N/R = A + B + C
    Int left = -1;
    Int right = 5000000000000000000; // 1e18 * 5

    left = max(left, A*P-P+1);
    left = max(left, Q*A+Q*B-Q+1);
    left = max(left, R*A+R*B+R*C-R+1);
    right = min(right, A*P);
    right = min(right, Q*A+Q*B);
    right = min(right, R*A+R*B+R*C);
    if (left <= right) {
        cout << left << " " << right;
    } else {
        cout << -1 << endl;
    }
}