#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 1000000007;
int dist(int a, int b) {
	int ans = 0;
	while (a != b) {
		if (a < b) {
			swap(a, b);
		}
		a >>= 1;
		++ans;
	}
	return ans;
}
int main() {
	int D, L, R, K;
	cin >> D >> L >> R >> K;
	int sl = 0, sr = 0;
	while ((2 << sl) <= L) ++sl;
	while ((2 << sr) <= R) ++sr;
	int patterns = 0;
	for (int i = (1 << sr) + (sl == sr ? 1 : 0); i < (2 << sr); ++i) {
		if (dist(1 << sl, i) == K) {
			++patterns;
		}
	}
	int ways = patterns;
	for (int i = 0; i < D; ++i) {
		for (int j = 1; j <= (1 << i) - (sl == i ? 1 : 0) - (sr == i ? 1 : 0); ++j) {
			ways = 1LL * ways * j % mod;
		}
	}
	ways = (1LL << sl) * ways % mod;
	cout << ways << endl;
	return 0;
}