import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
sys.setrecursionlimit(10**7)
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
p = 10 ** 9 + 7
mod = p
N = 2*10 ** 6  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
def cmb(n, r):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return ((fact[n] * factinv[r])%p) * factinv[n-r] % p

def pem(n,r):
    if (r < 0) or (n < r):
        return 0
    return (fact[n] * factinv[r])%p

b,a,x,y = na()
if a==0:
    if x==b and y==0:
        print(1)
    else:
        print(0)
elif a==1:
    if x+y==b and x>=0 and y>=0:
        print(1)
    else:
        print(0)
elif a==2:
    if abs(x)+y<=b and (x+y-b)%2==0 and y>=0:
        print(1)
    else:
        print(0)
else:
    if (x+y-b)%2 or abs(x)+abs(y)>b:
        print(0)
    else:
        r,l,u,d = 0,0,0,0
        rr,ll,uu,dd = a//4,(a-1)//4,(a-2)//4,(a-3)//4
        ans = 0
        c = (b-abs(x)-abs(y))//2
        if x>0:
            r = x
        else:
            l = -x
        if y>0:
            u = y
        else:
            d = -y
        for i in range(c+1):
            ans+=cmb(rr+r+i,rr)*cmb(ll+l+i,ll)%mod*cmb(uu+u+c-i,uu)%mod*cmb(dd+d+c-i,dd)%mod
            ans%=mod
            #print(cmb(rr+r+i,rr),cmb(ll+l+i,ll),cmb(uu+u+c-i,uu),cmb(dd+d+c-i,dd))
        print(ans)