#include <algorithm>
// #include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }

ll comb(ll n, ll r, vector<ll> &fact, vector<ll> &fact_inv) {
    if (r < 0) {
        return 0;
    }
    if (n < r) {
        return 0;
    }
    ll ret = fact[n];
    ret = (ret * fact_inv[n - r]) % mod1;
    ret = (ret * fact_inv[r]) % mod1;
    return ret;
}

ll nhr(ll n, ll r, vector<ll> &fact, vector<ll> &fact_inv) {
    if (r == 0) {
        return 1LL;
    }
    return comb(n + r - 1, r, fact, fact_inv);
}

int main() {
    ll A, B, X, Y;
    cin >> A >> B >> X >> Y;
    vector<ll> fact(2000002);
    fact[0] = 1;
    for (ll i = 0; i <= 2000000; i++) {
        fact[i + 1] = (fact[i] * (i + 1)) % mod1;
    }
    vector<ll> fact_inv(2000002);
    fact_inv[0] = 1;
    for (ll i = 0; i <= 2000000; i++) {
        fact_inv[i] = inv(fact[i], mod1);
    }
    ll ans = 0;
    for (ll x = 0; x <= A; x++) {
        ll x_plus = x;
        ll x_minus = x_plus - X;
        if (x_minus < 0) {
            continue;
        }

        ll ypsub = Y + A - x_plus - x_minus;
        if (ypsub % 2 != 0 || ypsub < 0) {
            continue;
        }
        ll y_plus = ypsub / 2;
        ll y_minus = y_plus - Y;
        if (y_minus < 0) {
            continue;
        }
        // debug_out(x_plus, y_plus, x_minus, y_minus);

        ll anssub = nhr(B / 4 + 1, x_plus, fact, fact_inv);
        anssub *= nhr((B + 3) / 4, y_plus, fact, fact_inv);
        anssub %= mod1;
        anssub *= nhr((B + 2) / 4, x_minus, fact, fact_inv);
        anssub %= mod1;
        anssub *= nhr((B + 1) / 4, y_minus, fact, fact_inv);
        anssub %= mod1;

        ans += anssub;
        ans %= mod1;
    }
    cout << ans << endl;
}