#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

constexpr int INF = INT_MAX;
constexpr ll MOD = ll(1e9) + 7;

int main() {
    ll D, L, R, K;
    cin >> D >> L >> R >> K;
    ll dl, dr;
    for(int i=0;i<D;i++){
        if(L >= (1<<i) && L < (1<<(i+1))) dl = i+1;
        if(R >= (1<<i) && R < (1<<(i+1))) dr = i+1;
    }
    if(dl > dr) swap(dl, dr);
    ll lca = (dl+dr-K)/2;
    if(abs(dl-dr)%2 != K%2 || abs(dl-dr) > K || lca <= 0){
        cout << 0 << endl;
        return 0;
    }
    vector<ll> fact(1<<D);
    fact[0] = 1;
    for(ll i=1;i<=1<<D;i++){
        fact[i] = fact[i-1]*i%MOD;
    }
    ll ans = ((1LL<<max(dl-lca-1,0LL))%MOD)*((1LL<<max(dr-lca-1,0LL))%MOD) %MOD *((1LL<<(lca-1))*2%MOD) %MOD;
    for(int i=1;i<=D;i++){
        ll x = 1LL<<(i-1);
        if(i == dl) x--;
        if(i == dr) x--;
        ans *= fact[x];
        ans %= MOD;
    }
    cout << ans << endl;
    return 0;
}