#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int64_t p, q, r, a, b, c;
    cin >> p >> q >> r >> a >> b >> c;
    int64_t ansmin = (a - 1) * p + 1;
    int64_t ansmax = a * p;
    ansmin = max(ansmin, q * (a + b - 1) + 1);
    ansmax = min(ansmax, q * (a + b));
    ansmin = max(ansmin, r * (a + b + c - 1) + 1);
    ansmax = min(ansmax, r * (a + b + c));
    if (ansmin <= ansmax)
        cout << ansmin << " " << ansmax << endl;
    else
        cout << -1 << endl;
    return 0;
}