#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define fix(x) fixed << setprecision(x)
#define eb emplace_back
constexpr char nl='\n';
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vs = vector<string>;
using pl = pair<long long, long long>;
template <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}
template <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}
template<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;
void fast_io(){cin.tie(nullptr);ios_base::sync_with_stdio(false);}
template <typename T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}
template <typename T> inline T lcm(T a, T b) {return a /gcd(a, b)*b;}
const ll INF = 1LL << 60;
const ld PI = acos(-1);
void solve(){
  ll H,W;cin>>H>>W;
  vl L(2),K(2);
  rep(i,2)cin>>L[i];
  rep(i,2)cin>>K[i];
  ll ok=H*W+1,ng=0; 
  while(abs(ok-ng)>1){
    ll mid=(ok+ng)/2;
    //mid回で条件を満たすことができるか
    ll now = -INF;
    for(ll i=0;i<=mid;i++){
      //0をi回使った場合
      ll w= min(i*L[1],H)*min((mid-i)*L[0],W);
      chmax(now,w+K[0]*i+K[1]*(mid-i));
    }
    for(ll i=0;i<=mid;i++){
      //0をi回使った場合
      ll h= min((mid-i)*L[1],H)*min(i*L[0],W);
      chmax(now,h+K[0]*(mid-i)+K[1]*i);
    }
    if(now>=H*W)ok=mid;
    else ng = mid;
  }
  cout<<ok<<endl;
}
int main(){
  fast_io();
  int num_tc = 1;
  //cin >> num_tc;
  rep(tc,num_tc){
    //cout << "Case #" << tc+1 << ": " ;// << endl;
    solve();
  }
}