// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

const ll mod = 1e9 + 7;

ll solve() {
    ll d, l, r, k;
    cin >> d >> l >> r >> k;
    d--; l--; r--;

    auto min_n = [&](ll dep) { return (1ll << dep) - 1; };
    auto max_n = [&](ll dep) { return min_n(dep + 1) - 1; };

    ll ld = 0, rd = 0;
    for(; ; ld++) if(min_n(ld) <= l && l <= max_n(ld)) break;
    for(; ; rd++) if(min_n(rd) <= r && r <= max_n(rd)) break;

    ll ans = 1;
    if(ld + k == rd) {
        (ans *= (1ll << ld)) %= mod;
        (ans *= (1ll << (rd - ld))) %= mod;
    } else {
        ll lca = ld - 1;
        for(; 0 <= lca; lca--) if(ld - lca + rd - lca == k) break;
        if(lca == -1) return 0;
        ll sel = 1;
        for(ll i = lca + 1; i < rd; i++) sel *= 2;
        DEBUG(lca, ld, rd, sel);
        (ans *= (1ll << ld)) %= mod;
        (ans *= sel) %= mod;
    }
    for(ll cur_d = 1; cur_d <= d; cur_d++) {
        ll cnt = 1ll << cur_d;
        cnt -= ld == cur_d;
        cnt -= rd == cur_d;
        for(ll i = 2; i <= cnt; i++) (ans *= i) %= mod;
    }
    return ans;
}

int main() {
    cout << solve() << endl;
    return 0;
}