#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

class mintcombination
{
public:
  vector<mint> fac, finv, inv;

  mintcombination(ll M)
  {
    fac.resize(M + 1);
    finv.resize(M + 1);
    inv.resize(M + 1);

    fac.at(0) = 1, finv.at(0) = 1;
    fac.at(1) = 1, finv.at(1) = 1, inv.at(1) = 1;

    for (ll i = 2; i <= M; i++)
    {
      fac.at(i) = fac.at(i - 1) * i;
      inv.at(i) = mint::mod() - inv.at(mint::mod() % i) * (mint::mod() / i);
      finv.at(i) = finv.at(i - 1) * inv.at(i);
    }
  }

  mint P(ll N, ll K)
  {
    if (N < K) return 0;
    if (N < 0 || K < 0) return 0;
    return fac.at(N) * finv.at(N - K);
  }

  mint C(ll N, ll K)
  {
    if (N < K) return 0;
    if (N < 0 || K < 0) return 0;
    return fac.at(N) * finv.at(K) * finv.at(N - K);
  }

  mint H(ll N, ll K)
  {
    return C(N + K - 1, K);
  }
};

int main()
{
  ll A, B, X, Y;
  cin >> A >> B >> X >> Y;

  if ((X + Y) % 2 != A % 2)
    FINALANS(0);

  ll spR = (B + 1) / 4 + ((B + 1) % 4 >= 1 ? 1 : 0);
  ll spU = (B + 1) / 4 + ((B + 1) % 4 >= 2 ? 1 : 0);
  ll spL = (B + 1) / 4 + ((B + 1) % 4 >= 3 ? 1 : 0);
  ll spD = (B + 1) / 4;

  //cerr << spR << " " << spU << " " << spL << " " << spD << " " << endl;

  mintcombination com(A + B + 10);

  mint ans = 0;
  for (ll R = 0; R <= A; R++)
  {
    ll L = R - X;
    ll U = (A + X + Y - 2 * R) / 2;
    ll D = (A + X - Y - 2 * R) / 2;

    if (L < 0 || U < 0 || D < 0)
      continue;

    //cerr << R << " " << U << " " << L << " " << D << " " << endl;

    mint tmp = 1;
    if (spR > 0)
      tmp *= com.C(R + spR - 1, R);
    if (spU > 0)
      tmp *= com.C(U + spU - 1, U);
    if (spL > 0)
      tmp *= com.C(L + spL - 1, L);
    if (spD > 0)
      tmp *= com.C(D + spD - 1, D);
    ans += tmp;
  }
  cout << ans.val() << endl;
}