#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>
#include <time.h>
#include <numeric>
using namespace std;
#define int long long
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
#define l1 list[index]
#define l2 list[index - 1]
#define l3 list[index + 1]
#define iif(i,j) ((i<0 && j<0) || (i>0 && j>0)) ? true : false 
typedef long long ll;
typedef pair<int, int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
const double PI = 3.14159265359;
int ca[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };



signed main() {
	double p, q, r, a, b, c;

	cin >> p >> q >> r >> a >> b >> c;

	vector<vector<double>>list(3, vector<double>(2, 0));
	vector<vector<ll>>list2(3, vector<ll>(2, 0));

	list[0][0] = a * p;
	list[0][1] = a * p - (p - 1);

	list[1][0] = (a + b) * q;
	list[1][1] = (a + b) * q - (q - 1);

	list[2][0] = (a + b + c) * r;
	list[2][1] = (a + b + c) * r - (r - 1);

	if (list[0][0] - (int)list[0][0] != 0)list2[0][0] = (int)list[0][0] + 1;
	else list2[0][0] = (int)list[0][0];

	if (list[0][1] - (int)list[0][1] != 0)list2[0][1] = (int)list[0][1] + 1;
	else list2[0][1] = (int)list[0][1];

	if (list[1][0] - (int)list[1][0] != 0)list2[1][0] = (int)list[1][0] + 1;
	else list2[1][0] = (int)list[1][0];
	
	if (list[1][1] - (int)list[1][1] != 0)list2[1][1] = (int)list[1][1] + 1;
	else list2[1][1] = (int)list[1][1];

	if (list[2][0] - (int)list[2][0] != 0)list2[2][0] = (int)list[2][0] + 1;
	else list2[2][0] = (int)list[2][0];

	if (list[2][1] - (int)list[2][1] != 0)list2[2][1] = (int)list[2][1] + 1;
	else list2[2][1] = (int)list[2][1];

	int sita = max({ list2[0][1],list2[1][1], list2[2][1] });
	int ue = min({ list2[0][0],list2[1][0], list2[2][0] });

	if (sita <= ue) {
		cout << sita << " " << ue << endl;
	}
	else {
		cout << -1 << endl;
	}



	return 0;
}