Teams

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<14)
#define MOD (1000000007)
ll pw(ll n,ll k){
    ll r(1);
    while(k){
        if(k&1)r*=n,r%=MOD;
        n*=n,n%=MOD;
        k>>=1;
    }
    return r;
}
ll inv(ll a){return pw(a,MOD-2);}
ll f[MX]={1},I[MX]={1};
void pre(){FT(1,MX)I[k]=inv(f[k]=f[k-1]*k%MOD);}
ll C(int N,int K){return N<K?0:(f[N]*I[K]%MOD)*I[N-K]%MOD;}
int main(void){
    int N,A,B,D;
    pre();
    while(~scanf("%d%d%d%d",&N,&A,&B,&D))
        printf("%lld\n",C(N,A)*pw(C(B,D),A)%MOD),
        assert(N>=A&&N<=1e6&&A>0),assert(B>=D&&B<=1e6&&D>0);
    return 0;
}