#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

#define MAX_N 2000010
ll inv[MAX_N+10],fac[MAX_N+10],ifac[MAX_N+10];

void setComb(){
  inv[0]=1;inv[1]=1;fac[1]=1;ifac[1]=1;fac[0]=1;ifac[0]=1;
  for(int i=2;i<MAX_N;i++){
    inv[i]=(-MOD/i)*inv[MOD%i]%MOD;
    fac[i]=fac[i-1]*i%MOD;
    ifac[i]=ifac[i-1]*inv[i]%MOD;

    inv[i]=(inv[i]+MOD)%MOD;
    fac[i]=(fac[i]+MOD)%MOD;
    ifac[i]=(ifac[i]+MOD)%MOD;
  }
  return;
}

ll comb(ll n,ll k){
  if(n<k||n<0||k<0) return 0;
  else return ((fac[n]*ifac[k]%MOD*ifac[n-k]%MOD+MOD)%MOD);
}

ll hcomb(ll n,ll r){
  if(n==0&&r==0) return 1;
  else if(n<0||r<0) return 0;
  else return comb(n+r-1,r-1);
}

int main(){
  int D,L,R,K;
  cin>>D>>L>>R>>K;

  setComb();

  int N=(1<<D);

  int x=0,y=0;
  for(int i=1;i<=D;i++){
    if((1<<(i-1))<=L&&L<(1<<i)) x=i;
    if((1<<(i-1))<=R&&R<(1<<i)) y=i;
  }


  if(y-x<=K&&y+x-2>=K){
    int r=-1;// lca
    int o=y-x;
    for(int i=x;i>=1;i--){
      if(o==K) r=i;
      o+=2;
    }
    if(r==-1){
      cout<<0<<endl;
      return 0;
    }

    ll res=1;
    for(int i=0;i<D;i++) res=res*fac[(1<<i)]%MOD;
    if(x==r){
        res=res*(1<<(y-r-1))%MOD;
        res=res*inv[(1<<(y-1))]%MOD;
        res=res*2%MOD;
    }else{
        res=res*(1<<(r-1))%MOD;
        res=res*(1<<(y-r-1))%MOD;
        res=res*inv[(1<<(y-1))]%MOD;
        res=res*(1<<(x-r-1))%MOD;
        if(x==y) res=res*inv[(1<<(x-1))-1]%MOD;
        else res=res*inv[(1<<(x-1))]%MOD;
        res=res*2%MOD;
    }
    cout<<(res+MOD)%MOD<<endl;
  }else cout<<0<<endl;

  return 0;
}