#include <iostream>
#define llint long long
#define mod 1000000007

using namespace std;

llint d, l, r, k;

const int FACT_MAX = 2000005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

void make_fact()
{
	llint val = 1;
	fact[0] = 1;
	for(int i = 1; i < FACT_MAX; i++){
		val *= i;
		val %= mod;
		fact[i] = val;
	}
	fact_inv[FACT_MAX-1] = modpow(fact[FACT_MAX-1], mod-2);
	for(int i = FACT_MAX-2; i >= 0; i--){
		fact_inv[i] = fact_inv[i+1] * (i+1) % mod;
	}
}

llint get(llint x)
{
	llint ret = 0;
	for(;x;x/=2) ret++;
	return ret;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> d >> l >> r >> k;
	make_fact();
	
	llint ans = 1;
	for(int i = 1; i <= d; i++) ans *= fact[1<<(i-1)], ans %= mod;
	//cout << ans << endl;
	
	llint dl = get(l), dr = get(r);
	if((dl+dr-k) % 2){
		cout << 0 << endl;
		return 0;
	}
	llint da = (dl+dr-k) / 2, f = dr - da;
	//cout << dl << " " << dr << " " << da << endl;
	
	if(dl != dr) ans *= 1<<f, ans %= mod, ans *= modpow(1<<(dr-1), mod-2), ans %= mod;
	else ans *= 1<<(f-1), ans %= mod, ans *= modpow((1<<(dr-1))-1, mod-2), ans %= mod;
	cout << ans << endl;
	
	return 0;
}