import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf = 1<<30;
enum mod = 10L^^9 + 7;

void main() {
    int h, w, a, b;
    scan(h, w, a, b);

    auto mc = ModComb(h + w);

    long ans;

    foreach (i ; 0 .. w - b) {
        ans += mc.comb(h - a - 1 + b + i, h - a - 1) * mc.comb(a - 1 + w - b - 1 - i, a - 1) % mod;
        if (ans > mod) ans-= mod;
    }

    writeln(ans);
}

struct ModComb {
    int _N;
    long[] _fact, _factinv;
    long _mod;

    this(int n, long mod = 10L^^9 + 7) {
        _N = n;
        _fact = new long[](_N + 1);
        _factinv = new long[](_N + 1);
        _mod = mod;

        _fact[0] = 1;
        foreach (i ; 1 .. _N + 1) {
            _fact[i] = (_fact[i-1] * i) % mod;
        }

        _factinv[_N] = _powmod(_fact[_N], mod - 2);
        foreach_reverse (i ; 0 .. _N) {
            _factinv[i] = (_factinv[i+1] * (i+1)) % mod;
        }
    }

    long comb(int n, int k) {
        return fact(n) * factinv(n - k) % mod * factinv(k) % mod;
    }

    long perm(int n, int r) {
        return fact(n) * factinv(n - r) % mod;
    }

    long fact(int n) {
        return _fact[n];
    }

    long factinv(int n) {
        return _factinv[n];
    }

    long _powmod(long x, long y) {
        return y > 0 ? _powmod(x, y>>1)^^2 % mod * x^^(y & 1) % mod : 1;
    }
}














































void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
