#include using namespace std; typedef long long ll; #define rep(i,n) for(int i=0;i>p>>q>>r>>a>>b>>c; ll minn=0; ll maxn=1000000000000000000; minn=max(minn,p*(a-1)+1); maxn=min(maxn,a*p); minn=max(minn,q*(a+b-1)+1); maxn=min(maxn,(a+b)*q); minn=max(minn,r*(a+b+c-1)+1); maxn=min(maxn,(a+b+c)*r); if(minn>maxn){ cout<<-1<