class Combination():
  def __init__(self, N, MOD):
    self.factorial=[1]*(N+1)
    self.fact_inv=[1]*(N+1)
    self.MOD=MOD
    for k in range(1,N):
      self.factorial[k+1]=(self.factorial[k]*(k+1))%MOD
    self.fact_inv[N]=pow(self.factorial[N],MOD-2,MOD)
    for k in range(N,0,-1):
      self.fact_inv[k-1]=(self.fact_inv[k]*k)%MOD
  def cmb(self, n, r):
    if n<0 or r<0 or n<r:
      return 0
    else:
      return (self.factorial[n]*self.fact_inv[r]*self.fact_inv[n-r])%self.MOD

A,B,X,Y=map(int,input().split())
if A%2!=(X+Y)%2:
  print(0)
  exit()
x_plus=(B+4)//4
y_plus=(B+3)//4
x_minus=(B+2)//4
y_minus=(B+1)//4
# print(x_plus,x_minus,y_plus,y_minus)
ans=0
mod=10**9+7
C=Combination(3*10**6,mod)
for a in range(A+1):
  b=a-X
  c=(A+X+Y-2*a)//2
  d=(A+X-Y-2*a)//2
  # print(a,b,c,d)
  if b<0 or c<0 or d<0:
    continue
  res=1
  if a>0:
    res=res*C.cmb(x_plus+a-1,a)%mod
  if b>0:
    res=res*C.cmb(x_minus+b-1,b)%mod
  if c>0:
    res=res*C.cmb(y_plus+c-1,c)%mod
  if d>0:
    res=res*C.cmb(y_minus+d-1,d)%mod
  ans+=res
print(ans%mod)