#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
constexpr ll mod=1e9+7;
ll mpow(ll x, ll n){
    ll ans = 1; x%=mod;
    while(n != 0){
        if(n&1) ans = ans*x % mod;
        x = x*x % mod;
        n = n >> 1;
    }
    return ans;
}
ll inv_mod(ll a){return mpow(a,mod-2);}
class Factorial{//階乗とその逆元を求めて計算に利用するクラス
 private:
    vector<ll> fac;
    vector<ll> ifac;
 public:
    
    Factorial(ll N){
        fac.push_back(1);
        REP(i,N) fac.push_back(fac[i]*(i+1)%mod);
        ifac.resize(N+1);
        ifac[N]=inv_mod(fac[N]);
        REP(i,N) ifac[N-1-i]=(ifac[N-i]*(N-i))%mod;
    }

    ll fact(ll a){return fac[a];}
    ll ifact(ll a){return ifac[a];}

    ll cmb(ll a,ll b){
        if(a==0&&b==0) return 1;
        if(a<b||a<0||b<0) return 0;
        ll tmp =ifact(a-b)*ifact(b)%mod;
        return tmp*fac[a]%mod;
    }
    ll per(ll a,ll b){
        if(a==0&&b==0) return 1;
        if(a<b||a<0||b<0) return 0;
        return fac[a]*ifac[a-b]%mod;
    }
};
int main(){
    ll d,l,r,k;cin>>d>>l>>r>>k;
    ll Ld,Rd;
    ll tmp=1;
    REP(i,d){
        if(tmp<=l&&l<2*tmp) Ld=i;
        if(tmp<=r&&r<2*tmp) Rd=i;
        tmp*=2;
    }
    ll p=(Ld+Rd-k);
    if(p&1||p<0||d<=p/2){
        cout<<0<<endl;
        return 0;
    }
    p/=2;
    Factorial get(tmp);
    ll ans=1;
    ll v=1;
    REP(i,d){
        ll cnt=0;
        if(i==Ld){
            ans*=v;
            ans%=mod;
            cnt++;
        }
        if(i==Rd){
            ans*=mpow(2,Rd-p-1);
            if(p==Ld) ans*=2;
            ans%=mod;
            cnt++;
        }
        ans*=get.fact(v-cnt);
        ans%=mod;
        v*=2;
    }
    cout<<ans<<endl;
}