#include<bits/stdc++.h>
using namespace std;
 
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl  
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
#define lb(v,n) lower_bound(v.begin(),v.end(),n)
#define ub(v,n) upper_bound(v.begin(),v.end(),n)
#define mae(v) max_element(v.begin(),v.end())
#define mie(v) min_element(v.begin(),v.end())
#define INF 0x7FFFFFFF
#define mod 1000000007
#define fir first
#define sec second
typedef long long ll;
////////////////////////////////////////////////////////////

ll p,q,r,a,b,c;

bool check(ll i){
	ll x , y , z;
	x = floor( (long double)i / p );
	y = floor( (long double)i / q ) - a;
	z = floor( (long double)i / r ) - a - b;

	if( i % p ) x++;
	if( i % q ) y++;
	if( i % r ) z++;

	if( x == a &&  y == b &&  z == c ) ret true;
	ret false;
}

ll rr;

ll bef_l = INF , bef_c = INF , bef_r = INF;

ll s_l( ll l , ll c , ll r  ){
	//cout << l << " " << c << " " << r << endl;
	//cout << check(c-1) <<  check(c) <<  check(c+1) << endl;
	if(   !check(c-1) && check(c) && check(c+1)  ){
		ret c;
	}


	if( r <= l ) ret -2;
	if( c == bef_c && l == bef_l && r == bef_r ) ret -2;
	bef_c = c;
	bef_l = l;
	bef_r = r;

	if ( check(c) ){
		ll idx = (c-l)/2+l;
		ret s_l(l, idx ,c );
	}
	else{
		ll idx = (r-c)/2+c;
		ret s_l(c, idx ,r);
	}
}


int main(){
	cin >> p >> q >> r >> a >> b >> c;

	rr = min(p*a , min( (a+b)*q , (a+b+c)*r));

	ll l = s_l(0,rr/2,rr );

	if( l == -2 ){
		cout << -1 << endl;
		ret 0;
	}

	cout << l << " " << rr<< endl;


	ret 0;
}