MOD = 10 ** 9 + 7
N = 2000000
fact = [0 for _ in range(N)]
invfact = [0 for _ in range(N)]
fact[0] = 1
for i in range(1, N):
    fact[i] = fact[i - 1] * i % MOD

invfact[N - 1] = pow(fact[N - 1], MOD - 2, MOD)

for i in range(N - 2, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % MOD

def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return (fact[n] * invfact[k] % MOD) * invfact[n - k] % MOD

def nHk(n, k):
    if n == k == 0: return 1
    return nCk(n + k - 1, k)

a, b, x, y = map(int, input().split())
if a % 2 != (x + y) % 2 or a < abs(x) + abs(y):
    print(0)
    exit()

xp = xm = yp = ym = 0
if x > 0:
    xp = x
    a -= x
else:
    xm = -x
    a += x
if y > 0:
    yp = y
    a -= y
else:
    ym = -y
    a += y
    
a //= 2
xp_b = (b + 4) // 4
yp_b = (b + 3) // 4
xm_b = (b + 2) // 4
ym_b = (b + 1) // 4
lst1 = [xp, yp, xm, ym]
lst2 = [xp_b, yp_b, xm_b, ym_b]
ans = 0

for i in range(a + 1):
    tmp = 1
    for j, (l1, l2) in enumerate(zip(lst1, lst2)):
        if j % 2 == 0:
            tmp *= nHk(l2, l1 + i)
        else:
            tmp *= nHk(l2, l1 + a - i)
        tmp %= MOD
    ans += tmp
    ans %= MOD
print(ans)