#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

// calc ceil(a/b) 
template<typename T>
T ceil_div(T a, T b){
    return (a+b-1)/b;
}

const ll inf = 1e18;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll h, w, la, lb, ka, kb; cin >> h >> w >> la >> lb >> ka >> kb;
    ll ans = inf;
    ll p = h*w+la*lb;
    auto ok = [&](ll x, ll y){
        ll rem_h = max(0ll, h-x*la);
        ll rem_w = max(0ll, w-y*lb);
        ll rem = rem_h*w+rem_w*h-rem_h*rem_w;
        return x*ka+y*kb >= rem;
    };
    ll y = h+w;
    for(ll x = 0; x <= h+w; x++){
        while(y > 0 && ok(x, y)) y--;
        if(ok(x, y)){
            chmin(ans, x+y);
        }else{
            chmin(ans, x+y+1);
        }
    }
    cout << ans << endl;
}