#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 1e6 + 5;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
using namespace std;


ll pw(ll a, ll b)
{
    if(a == 0) return 1;
    if(b == 0) return 1;
    ll res = pw(a * a % mod, b >> 1);
    if(b&1) res = res * a % mod;
    return res;
}

ll A[N * 2] {1};
ll invA[N * 2] {1};

void add(ll &a, ll b)
{
    a += b%mod + mod;
    a %= mod;
}

ll C(int a, int b)
{
    if(b > a)return 0;
    return A[a] * invA[b] % mod * invA[a - b] % mod;
}

int cnt(int sigle_seat, int pair_seat, int I, ll& num)
{
    if(pair_seat >= I)
    {
        num = num * C(pair_seat, I) % mod * pw(2, I) % mod;
        return I;
    }
    else
    {
        num = num * C(sigle_seat, min(I - pair_seat, sigle_seat)) % mod
              * C(pair_seat, max(I - pair_seat - sigle_seat, 0)) % mod
              * pw(2, pair_seat - max(I - pair_seat - sigle_seat, 0)) %mod;
        return pair_seat - max(I - pair_seat - sigle_seat, 0);
    }
}

// cnt for no G
int cnt2(int pair_seat, int I, int E, ll& num)
{
    int ans = E;
    num = num * C(pair_seat, E / 2) % mod;
    if (E % 2 == 1)
    {
        ans--;
        pair_seat -= E / 2;
        E = 1;
    }
    else
    {
        pair_seat -= E / 2;
        E = 0;
    }
    //2 3 1
    if (I < pair_seat)
    {
        num = num * C(pair_seat, I + E) % mod * pw(2, I + E) % mod
         * C(I + E , E) % mod;
        ans += I;
    }
    else
    {
//        assert(pair_seat - E - max(I - pair_seat - E, 0))
        num = num * C(pair_seat, E) % mod
              * pw(2, E) % mod * C(pair_seat - E, max(I - pair_seat - E, 0)) % mod
              * pw(2, pair_seat - E - max(I - pair_seat - E, 0)) % mod;
        ans += E + pair_seat - (E + I - pair_seat);
    }
    return ans;
}



int main()
{
    IOS
    for(int i = 1; i < N * 2; i++)
    {
        A[i] = A[i - 1] * i % mod;
        invA[i] = pw(A[i], mod - 2);
    }
    int n, g, i, e;
    ll num;
    cin >> n >> g >> i >> e;
    if (g >= 2 * n)
    {
        g = 2 * n;
    }
    if(g + e >= 2 * n)
    {
        e = 2 * n - g;
    }
    if(g + i + e >= 2 * n)
    {
        i = 2 * n - g - e;
    }
    ll up = 0;
    ll down = 0;
    ll f = 0;
    auto ff = [&](ll i)
    {
        int k = g - i;
        return  C(n, i) * C(i, k) % mod * pw(2, i - k) % mod * pw(C(2*n, g), mod - 2);
    };
    for(int k = g/2; k >= 0; k--)
    {
        // k pair easyG sit together
        int sigleG = g - k * 2;
        if(sigleG + k > n)continue;
        int ans = g;
        num = C(n, k) * C(n - k, sigleG) % mod * pw(sigleG, 2) % mod;
        if(sigleG >= e)
        {
            ans += e;
            num = num * C(sigleG, e) % mod;
            ans += cnt(sigleG - e, n - k - sigleG, i, num);
        }
        else // sigleG < e
        {
            ans += sigleG;
            ans += cnt2(n - sigleG - k, i, e - sigleG, num);
        }
        num = ff(g - k) % mod;
        add(up, num * ans % mod);
        add(down, num);
    }

//    num * p / down
    cout << up * pw(down, mod - 2) % mod << endl;
//    }




}