#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>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
ll f[5000001], invf[5000001];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i%MOD;
    invf[n]=inv(f[n]);
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD;
}
int main()
{
	int d, l, r, k;
    cin>>d>>l>>r>>k;
    int dl=0, dr=0;
    int l1=l, r1=r;
    while(l1){
        dl++;
        l1>>=1;
    }
    while(r1){
        dr++;
        r1>>=1;
    }
    if((dl+dr)%2!=k%2 || dl+dr<k){
        cout<<0<<endl;
        return 0;
    }
    int dp=(dl+dr-k)/2;
    ll c[22]={};
    for(int i=min(dl, dr); i>=dp; i--){
        c[i]=(1ll<<(dl-i+dr-i))%MOD;
        for(int j=i+1; j<=min(dl, dr); j++){
            c[i]+=MOD-c[j];
            c[i]%=MOD;
        }
    }
    ll ans=c[dp];
    fac(1<<d);
    if(dl==dr){
        for(int i=1; i<=d; i++){
            if(i==dl){
                (ans*=f[(1<<(i-1))-2])%=MOD;
            }else{
                (ans*=f[(1<<(i-1))])%=MOD;
            }
        }
    }else{
        for(int i=1; i<=d; i++){
            if(i==dl || i==dr){
                (ans*=f[(1<<(i-1))-1])%=MOD;
            }else{
                (ans*=f[(1<<(i-1))])%=MOD;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}