import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const H = readLong;
      const W = readLong;
      long LA = readLong;
      long LB = readLong;
      const KA = readLong;
      const KB = readLong;
      
      /*
        (LA W + KA) a + KB b >= H W
        KA a + (LB H + KB) b >= H W
      */
      (LA *= W) += KA;
      (LB *= H) += KB;
      const HW = H * W;
      long ans = H + W;
      foreach (a; 0 .. H + W) {
        long b;
        if (LA * a < HW) chmax(b, KB ? (((HW - LA * a) + KB - 1) / KB) : (H + W));
        if (KA * a < HW) chmax(b, LB ? (((HW - KA * a) + LB - 1) / LB) : (H + W));
        debug {
          if (H + W <= 20) {
            writeln(a, ": ", b);
          }
        }
        chmin(ans, a + b);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}