#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


ll H,W,LA,LB,KA,KB;

int ok(ll a,ll b) {
	ll ah=min(H,a*LA);
	ll aw=min(W,b*LB);
	return (H*W-ah*aw<=a*KA+b*KB);
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>H>>W>>LA>>LB>>KA>>KB;
	int mi=1<<28;
	for(y=0;y<=1000000;y++) {
		int XL=-1,XR=W+1;
		while(XL+1<XR) {
			int XM=(XL+XR)/2;
			if(ok(y,XM)) XR=XM;
			else XL=XM;
		}
		mi=min(mi,y+XR);
	}
	cout<<mi<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}