#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
int mod = 1000000007;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
template<class... T> int add(int x, T... y) { return add(x, add(y...)); }
int mul(int x, int y) { return 1LL * x * y % mod; }
template<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }
int sub(int x, int y) { return add(x, mod - y); }
int modpow(int a, long long b) { int ret = 1; while (b > 0) { if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1; } return ret; }
int modinv(int a) { return modpow(a, mod - 2); }
int fac[201010], ifac[201010];
void initfac() {
fac[0] = ifac[0] = 1;
rep(i, 1, 201010) fac[i] = 1LL * i * fac[i - 1] % mod;
rep(i, 1, 201010) ifac[i] = modinv(fac[i]);
}
int aCb(int a, int b) {
if (b < 0 || a < b) return 0;
return (1LL * fac[a] * ifac[a - b] % mod) * ifac[b] % mod;
}
//-----------------------------------------------------------------------------------
int R, C, X, Y, D, L;
int cnt(int x, int y) {
if (x < 0 || y < 0) return 0;
if (x * y < D + L) return 0;
return mul(aCb(x * y, D), aCb(x * y - D, L));
}
//-----------------------------------------------------------------------------------
int main() {
cin >> R >> C >> X >> Y >> D >> L;
initfac();
int ans = cnt(X, Y);
ans = sub(ans, add(mul(cnt(X - 1, Y), 2), mul(cnt(X, Y - 1), 2)));
ans = add(ans, add(mul(cnt(X - 1, Y - 1), 4), cnt(X - 2, Y), cnt(X, Y - 2)));
ans = sub(ans, add(mul(cnt(X - 2, Y - 1), 2), mul(cnt(X - 1, Y - 2), 2)));
ans = add(ans, cnt(X - 2, Y - 2));
ans = mul(ans, (R - X + 1), (C - Y + 1));
cout << ans << endl;
}