#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

const long long MOD = 1e9 + 7;

int depth(int x) {
  int d = 0;
  while (x) {
    x >>= 1;
    ++d;
  }
  return d;
}

int lca(int l, int r, int k, int d) {
  int x = depth(l) + depth(r) - k;
  if (x % 2)
    return -1;
  x /= 2;
  if (1 <= x && x <= d)
    return x;
  return -1;
}

int solve(int d, int l, int r, int k) {
  vector<long long> f(1000000);
  f[0] = 1;
  for (int i = 1; i < 1000000; i++)
    f[i] = f[i-1]  * i % MOD;
  
  int x = lca(l, r, k, d);
  if (x == -1)
    return 0;
  
  long long ret = 1;
  if (depth(l) == depth(x)) {
    for (int i = 1; i <= d; i++) {
      int j = 1<<(i-1);
      ret = ret * f[j] % MOD;
    }
  } else if (depth(l) < depth(r)) {
    for (int i = 1; i <= d; i++) {
      int j = 1<<(i-1);
      if (i == depth(r)) {
        int tmp = 1<<(i-x-1);
        ret = ret * tmp * f[j-1] % MOD;
      } else {
        ret = ret * f[j] % MOD;
      }
    }
  } else {
    for (int i = 1; i <= d; i++) {
      int j = 1<<(i-1);
      if (i == depth(r)) {
        int tmp = 1<<(i-x-1);
        ret = ret * j * tmp * f[j-2] % MOD;
      } else {
        ret = ret * f[j] % MOD;
      }
    }
  }
  return ret;
}


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int d, l, r, k;
  cin >> d >> l >> r >> k;
  cout << solve(d, l, r, k) << endl;
  
  return 0;
}