#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
struct modinv {
  int n; vector<mint> d;
  modinv(): n(2), d({0,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(-d[mint::mod()%n]*(mint::mod()/n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} invs;
struct modfact {
  int n; vector<mint> d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*n), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} facts;
struct modfactinv {
  int n; vector<mint> d;
  modfactinv(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*invs(n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} ifacts;
mint comb(int n, int k) {
  if (n < k || k < 0) return 0;
  return facts(n)*ifacts(k)*ifacts(n-k);
} 
int main(){
  int a,b,x,y;cin>>a>>b>>x>>y;
  mint ans=0;
  rep(i,a+1){
    int ii=i-x;
    if(ii<0)continue;
    int r=a-i-ii; 
    if(r<0)continue;
    //j+jj=r j-jj=y
    if((r+y)&1)continue;
    int j=(r+y)/2; int jj=r-j;
    //if(i==1)cout<<i<<' '<<ii<<' '<<j<<' '<<jj<<"\n";
    if(j<0||jj<0)continue;
    mint res=1;
    if(i)res*=comb(i+(b+4)/4-1,i);
    if(ii)res*=comb(ii+(b+2)/4-1,ii);
    if(j)res*=comb(j+(b+3)/4-1,j);
    if(jj)res*=comb(jj+(b+1)/4-1,jj);
    ans+=res;
  }
  cout<<ans.val();
}