#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/

int main() {
	lint P, Q, R, A, B, C;
	cin >> P >> Q >> R >> A >> B >> C;
	lint m1, m2, m3, M1, M2, M3;
	m1 = P * (A - 1) + 1;
	m2 = Q * (A + B - 1) + 1;
	m3 = R * (A + B + C - 1) + 1;
	M1 = P * A;
	M2 = Q * (A + B);
	M3 = R * (A + B + C);
	int ans;
	vector<lint>m(3);
	m = { m1,m2,m3 };
	vector<lint>M(3);
	M = { M1,M2,M3 };
	sort(m.begin(), m.end());
	sort(M.begin(), M.end());
	ans = M.at(0) - m.at(2);
	if (ans >= 0) {
		cout << m.at(2) << ' ' << M.at(0) << endl;
	}
	else {
		cout << -1 << endl;
	}
}