#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define ef else if

const int MOD = 1'000'000'007;
LL p[] = { 1, 2, 48, 1935360, 187767522, 588272078, 968309376, 754829929, 796867150, 94305900, 797182173, 825553566, 800802892, 622822155, 398493013, 843531154, 634777479, 233483695, 319671727, 608676892 };
LL x[] = { 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288 };
LL y[] = { 1, 500000004, 250000002, 125000001, 562500004, 281250002, 140625001, 570312504, 285156252, 142578126, 71289063, 535644535, 767822271, 883911139, 941955573, 970977790, 485488895, 742744451, 871372229, 935686118 };
LL z[] = { 0, 1, 333333336, 142857144, 466666670, 129032259, 15873016, 480314964, 556862749, 344422703, 94819160, 974596978, 492551896, 527652305, 840932680, 403149513, 243411919, 219232326, 372991080, 254269133 };

int main() {
	int d, l, r, k;
	scanf("%d%d%d%d", & d, & l, & r, & k);
	l = 32 - __builtin_clz(l) - 1;
	r = 32 - __builtin_clz(r) - 1;
	
	LL ans = 0;
	if(r - l <= k && k <= l + r && (l + r + k) % 2 == 0) {
		ans = p[d - 1];
		int m = (l + r - k) / 2;
		if(l == r) { (ans *= x[r - m - 1] * z[r] % MOD) %= MOD; }
		ef(l == m) { (ans *= x[r - m - 0] * y[r] % MOD) %= MOD; }
		else       { (ans *= x[r - m - 1] * y[r] % MOD) %= MOD; }
	}
	printf("%lld\n", ans);
	
	return 0;
}