#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <unordered_map>
#include <vector>


#define INF 4000000000000000000LL
#define MOD 1000000007
#define ALL(x) std::begin(x), std::end(x)


class modint_t;


modint_t modpow(long long x, long long y);


class modint_t {
  friend std::ostream& operator<<(std::ostream& ofs, const modint_t a);

public:
  modint_t(long long xx = 0) : x(xx % MOD) {};

public:
  long long get() {
    normalize();

    return x;
  };

public:
  bool operator==(modint_t a) const {
    return x == a.x;
  };

  bool operator!=(modint_t a) const {
    return ! (*this == a);
  };

public:
  modint_t operator+(const modint_t& a) const {
    return (x + a.x) % MOD;
  };

  modint_t operator-(const modint_t& a) const {
    return (x - a.x) % MOD;
  };

  modint_t operator*(const modint_t& a) const {
    return x * a.x % MOD;
  };

  modint_t operator/(const modint_t& a) const {
    return (*this) * a.inversed();
  };

  // Note that operator^'s priority is quite low in C++...
  modint_t operator^(long long i) const {
    return modpow(x, i);
  };

public:
  modint_t& operator+=(const modint_t& a) {
    (x += a.x) %= MOD;

    return *this;
  };

  modint_t& operator-=(const modint_t& a) {
    (x -= a.x) %= MOD;

    return *this;
  };

  modint_t& operator*=(const modint_t& a) {
    (x *= a.x) %= MOD;

    return *this;
  };

  modint_t& operator/=(const modint_t& a) {	// Not tested
    (x *= a.inversed().x) %= MOD;

    return *this;
  };

public:
  modint_t inversed() const {
    assert(x % MOD);

    return modpow(x, MOD - 2);
  };

  void inverse() {
    assert(x % MOD);

    x = modpow(x, MOD - 2).x;
  };

private:
  void normalize() {
    while (! (0 <= x && x < MOD))
      x = (x + MOD) % MOD;
  };

private:
  long long x;
};

modint_t operator+(long long a, const modint_t& b)
{
  return modint_t(a) + b;
}

modint_t operator-(long long a, const modint_t& b)
{
  return modint_t(a) - b;
}

modint_t operator*(long long a, const modint_t& b)
{
  return modint_t(a) * b;
}

modint_t operator/(long long a, const modint_t& b)
{
  return modint_t(a) / b;
}

std::ostream& operator<<(std::ostream& ofs, modint_t a)
{
  a.normalize();

  ofs << a.x;

  return ofs;
}

modint_t modpow(long long x, long long y)
{
  modint_t xx = x, p = 1;

  for ( ; y; xx *= xx, y >>= 1)
    if (y & 1)
      p *= xx;

  return p;
}

long long modncr(int n, int r)
{
  assert(n >= 0);
  assert(r >= 0);

  if (n == 0)
    return r == 0 ? 1 : 0;

  if (r > n)
    return 0;

  long long num = 1, denom = 1;

  int dm = std::min(r, n - r);
  int dp = std::max(r, n - r);

  for (int i = dp + 1; i <= n; i ++)
    (num *= i) %= MOD;

  for (int i = 2; i <= dm; i ++)
    (denom *= i) %= MOD;

  return (num * modpow(denom, MOD - 2).get()) % MOD;
}

template<size_t T>
class modinv_t {
public:
  modinv_t() {
    a_[0] = 1;

    for (int i = 1; i < T; i ++)
      (a_[i] = i * a_[i - 1]) %= MOD;

    modint_t inv(a_[T - 1]);

    inv.inverse();

    for (int i = T - 1; i > 0; inv *= i, i --)
      a_[i] = (inv * a_[i - 1]).get();

#if 1
    for (int i = 1; i < T; i ++)
      assert(i * a_[i] % MOD == 1);
#endif
  };

public:
  long long operator[](size_t i) const {
    if (! (i < T))
      std::cerr << "i=" << i << std::endl;

    assert(i < T);

    return a_[i];
  };

private:
  long long a_[T];
};

modinv_t<222222> modinv;


int main(int argc, char** argv)
{
  std::cin.tie(0);
  std::ios_base::sync_with_stdio(0);

  std::cout << std::fixed << std::setprecision(6);
  std::cerr << std::fixed << std::setprecision(6);

  int H, W, A, B;

  std::cin >> H >> W >> A >> B;

  long long n = H + W - 2, r = W - 1, a = modncr(n, r);

  long long x1 = B, y1 = H - A + 1, n1 = x1 + y1 - 2, r1 = x1 - 1, b = modncr(n1, r1);

  long long w = W - B, h = A, n2 = w + h - 2, r2 = w - 1, c = modncr(n2, r2);

  long long d = 0;

  for (int i = 0; i < A; i ++) {
    (d += b * c % MOD) %= MOD;

    b = (modint_t(b) * (n1 +  1) * modinv[n1 - r1 + 1]).get();
    c = (modint_t(c) * (n2 - r2) * modinv[n2         ]).get();

    n1 ++;
    n2 --;
  }

  std::cout << (a - d + MOD) % MOD << std::endl;
  
  return 0;
}


Measured memory_bytes: 2048