#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)

using namespace std;
using ll = long long;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll P, Q, R, A, B, C;
  cin >> P >> Q >> R >> A >> B >> C;
  // A-1 < N/P <= A
  // A+B-1 < N/Q <= A+B
  // A+B+C-1 < N/R <= A+B+C
  ll mn = max({(A-1)*P, (A+B-1)*Q, (A+B+C-1)*R})+1;
  ll mx = min({A*P, (A+B)*Q, (A+B+C)*R});
  if (mn > mx) {
    cout << -1 << endl;
  } else {
    cout << mn << ' ' << mx << endl;
  }
}