a,b,x,y = map(int,input().split())
mod = 10**9+7

### for bigger prime 
fact = [1,1]
finv = [1,1]
inv = [0,1]
 
for i in range(2,2*10**6+5):
    fact.append((fact[-1]*i)%mod)
    inv.append((inv[mod%i]*(mod-mod//i))%mod)
    finv.append((finv[-1]*inv[-1])%mod)
 
def nCr(n,r,mod):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]%mod*finv[n-r]%mod

ans = 0
r = (b+4)//4
u = (b+3)//4
l = (b+2)//4
d = (b+1)//4
if y < 0:
    u,d = d,u
    y = abs(y)
for nr in range(a+1):
    if nr < x:
        continue

    nl = nr-x
    if nl and l == 0:
        continue

    ud = a-nr-nl
    if ud < y:
        continue
    if (ud-y)%2:
        continue

    nu = y+(ud-y)//2
    if nu and u == 0:
        continue

    nd = (ud-y)//2
    if nd and d == 0:
        continue

    base = nCr(nr+r-1,r-1,mod)*nCr(nl+l-1,l-1,mod)%mod*nCr(nu+u-1,u-1,mod)*nCr(nd+d-1,d-1,mod)
    ans += base%mod
    ans %= mod
print(ans)