using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (a, b, x, y) = (c[0], c[1], c[2], c[3]);
        WriteLine(Robot(a, b, x, y));
    }
    static long Robot(int a, int b, int x, int y)
    {
        var (r, u, l, d) = ((b + 4) / 4, (b + 3) / 4, (b + 2) / 4, (b + 1) / 4);
        var mod = 1_000_000_007;
        var ncr = new NCR(a + b, mod);
        var ans = 0L;
        for (var v = 0; v <= a; ++v)
        {
            var h = a - v;
            if (v < Math.Abs(x)) continue;
            if (h < Math.Abs(y)) continue;
            if ((v - x) % 2 != 0) continue;
            if ((h - y) % 2 != 0) continue;
            var sub = 1L;
            var mr = v - (v - x) / 2;
            var ml = (v - x) / 2;
            var mu = h - (h - y) / 2;
            var md = (h - y) / 2;
            sub = sub * ncr.Calc(mr + r - 1, r - 1) % mod;
            if (ml > 0)
            {
                if (l == 0) continue;
                sub = sub * ncr.Calc(ml + l - 1, l - 1) % mod;
            }
            if (mu > 0)
            {
                if (u == 0) continue;
                sub = sub * ncr.Calc(mu + u - 1, u - 1) % mod;
            }
            if (md > 0)
            {
                if (d == 0) continue;
                sub = sub * ncr.Calc(md + d - 1, d - 1) % mod;
            }
            ans = (ans + sub) % mod;
        }
        return ans;
    }
    class NCR
    {
        int[] facts;
        int[] revFacts;
        int mod;
        public NCR(int n, int mod)
        {
            facts = new int[n + 1];
            revFacts = new int[n + 1];
            this.mod = mod;
            facts[0] = 1;
            var tmp = 1L;
            for (var i = 1; i <= n; ++i)
            {
                tmp = tmp * i % mod;
                facts[i] = (int)tmp;
            }
            tmp = Exp(facts[n], mod - 2);
            revFacts[n] = (int)tmp;
            for (var i = n; i > 1; --i)
            {
                tmp = tmp * i % mod;
                revFacts[i - 1] = (int)tmp;
            }
            revFacts[0] = 1;
        }
        public long Exp(long n, long k)
        {
            n = n % mod;
            if (k == 0) return 1;
            if (k == 1) return n;
            var half = Exp(n, k / 2);
            var result = half * half % mod;
            return ((k % 2) == 0) ? result : (result * n % mod);
        }
        public long Calc(int n, int r)
        {
            return (long)facts[n] * revFacts[r] % mod * revFacts[n - r] % mod;
        }
        /// <summary>nが大きくrが小さい場合の計算</summary>
        public long Calc2(int n, int r)
        {
            var tmp = 1L;
            for (var i = 0; i < r; ++i)
            {
                tmp = tmp * (n - i) % mod;
            }
            return tmp * revFacts[r] % mod;
        }
        public long NPR(int n, int r)
        {
            return (long)facts[n] * revFacts[r] % mod;
        }
        public long Fact(int n)
        {
            return facts[n];
        }
        public long RevFact(int n)
        {
            return revFacts[n];
        }
        public long Inverse(int n)
        {
            return (long)revFacts[n] * facts[n - 1] % mod;
        }
    }
}