#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 3e18;
const ll fact_table = 800000;
double Pi = 3.1415926535897932384626;
 
vector<ll> G[550010];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
 

//ll mod = 998244353;
ll mod = 1000000007;
 
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 

ll fact[fact_table + 5],rfact[fact_table + 5];
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}

 
ll n,m,num,sum,a,b,c,d,e,g,h,w,i,j,q,r,l;
ll k,ans;
ll x[500005],y[500005],z[500005];

char s[500005];

int main(){
    cin >> d >> a >> b >> k;
    c3_init();
    l = r = 1;
    ll al, bl;
    al = bl = -1;
    for(int i=0;i<d;i++){
        if(l <= a && a <= r){
            al = i;
        }
        if(l <= b && b <= r){
            bl = i;
        }
        l = l * 2;
        r = r * 2 + 1;
    }
    ll flag1, flag2;
    flag1 = (k) % 2;
    flag2 = (al - bl + 3000) % 2;
    if(flag1 != flag2){
        p(0);
        return 0;
    }
    ll depth = -1;
    ll check = min(al, bl);
    for(int i=0;i<d;i++){
        if(al - i + bl - i == k && i <= al){
            depth = min(al - i,bl - i);
        }
    }
    if(depth <= -1){
        p(0);
        return 0;
    }
    num = 1;
    ans = 1;
    depth --;
    for(int i=0;i<depth;i++){
        //ans *= num;
        num *= 2;
        ans %= mod;
        num %= mod;
    }
    ans = num;
    ll nodes = 1;
    if(al == bl){
        for(int i=0;i<d;i++){
            ans *= fact[nodes];
            ans %= mod;
            if(i == check){
                ans *= rui(nodes - 1,mod - 2);
                ans %= mod;
            }
            nodes *= 2;
        }
    }else{
        for(int i=0;i<d;i++){
            if(i == check){
                ans *= fact[nodes - 1];
            }else{
                ans *= fact[nodes];
            }
            nodes *= 2;
            ans %= mod;

        }
    }
    p(ans);
    return 0;
}