#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll mod = 1000000007;

int main() {
    int d, l, r, k;
    cin >> d >> l >> r >> k;
    int d1 = 0, d2 = 0;
    int tmp1 = l, tmp2 = r;
    while(tmp1 > 0) {
        d1++;
        tmp1 /= 2;
    }
    while(tmp2 > 0) {
        d2++;
        tmp2 /= 2;
    }
    if(k % 2 != (d2 - d1) % 2) {
        cout << 0 << endl;
        return 0;
    }
    k -= (d2 - d1); k /= 2;
    if(d1 - k <= 0) {
        cout << 0 << endl;
        return 0;
    }
    int d3 = d1 - k;
    ll ans = (1 << (d3 - 1));
    ans *= 2;
    if(d1 != d3) ans *= (1LL << (d1 - d3 - 1));
    if(d2 != d3) ans *= (1LL << (d2 - d3 - 1));
    ans %= mod;
    for(int i = 1; i <= d; i++) {
        int sum = (1 << (i - 1));
        if(i == d1) sum--;
        if(i == d2) sum--;
        for(ll j = sum; j > 0; j--) {
            ans *= j;
            ans %= mod;
        }
    }
    cout << ans << endl;
    return 0;
}