#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint1000000007;
mint f[4000010], invf[4000010];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i;
    invf[n]=f[n].inv();
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1);
}
mint comb(int x, int y){
    if(!(0<=y && y<=x)) return 0;
    return f[x]*invf[y]*invf[x-y];
}
int a, b, x, y;
int main()
{
    cin>>a>>b>>x>>y;
    fac(4000000);
    mint ans=0;
    for(int p=0; p<=a; p++){
        int q=a-p;
        if((x+p)%2!=0 || (y+q)%2!=0 || x+p<0 || p-x<0 || y+q<0 || q-y<0)continue;
        int c[4]={b/4,b/4,b/4,b/4};
        for(int j=0; j<b%4+1; j++) c[j]++;
        int d[4]={(x+p)/2,(y+q)/2,(p-x)/2,(q-y)/2};
        mint z=1;
        for(int j=0; j<4; j++){
            if(c[j]==0 && d[j]==0)continue;
            z*=comb(c[j]-1+d[j], d[j]);
        }
        ans+=z;
    }
    cout<<ans.val()<<endl;
    return 0;
}