#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;


int gw, gh, la, lb;
LL ka, kb;
char check(int r, int c) {
    LL rc=r; rc*=la;
    LL cc=c; cc*=lb;
    if (rc>gh) rc=gh;
    if (cc>gw) cc=gw;
    rc*=cc;
    LL xx=gh; xx*=gw; xx-=rc;
    rc=r; rc*=ka;
    cc=c; cc*=kb;
    if (xx<=rc+cc) return 1;
    return 0;
}
int main() {
    int n, i, j, r, nj;
    int h, w;
    LL v, t, x, d;
    scanf("%d %d %d %d %lld %lld", &h, &w, &la, &lb, &ka, &kb);
    gh=h; gw=w;
    r = h+w;
    for (i=0; ; i++) {
        if (i>r) break;
        x=i; x*=la; if (x>=h) x=0; else x=(h-x)*w;
        v=ka; v*=i;//   t=kb; t*=w; t*=h;
        if (v<x&&kb==0) continue;
        d=x; if (d<w) d=w;
        j=-1; while(d) {
            while(1) {
                nj=j+d; if (nj>w) break;
                if (check(i, nj)) break;
                j=nj;
            }
            d>>=1;
        }
        j++;
        r = min(r, i+j);
    }
    printf("%d\n", r);
    return 0;
}