#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  long long p, q, r, a, b, c; cin >> p >> q >> r >> a >> b >> c;
  long long mn = 1, mx = LINF;
  mn = max(mn, (a - 1) * p + 1); mx = min(mx, a * p);
  mn = max(mn, (a + b - 1) * q + 1); mx = min(mx, (a + b) * q);
  mn = max(mn, (a + b + c - 1) * r + 1); mx = min(mx, (a + b + c) * r);
  if (mx < mn) {
    cout << -1 << '\n';
  } else {
    cout << mn << ' ' << mx << '\n';
  }
  return 0;
}