# include using namespace std; long long m,l,a1,a2,b1,b2; int maxs,f,s; void trywithout() { long long left = m*a1 +m*a2; for(int i=1;i<=4;i++) { if(left>m>>l>>a1>>a2>>b1>>b2; maxs = 0; trywithout(); trywithfirst(); //cout<>t; while(t--) solve(); return 0; }