#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
const int INF=1<<30;
const LL MAX=1e9+7;

void array_show(int *array,int array_n,char middle=' '){
	for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
	for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
	if(vec_n==-1)vec_n=vec_s.size();
	for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
	if(vec_n==-1)vec_n=vec_s.size();
	for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}

LL kai[1<<21];

int main(){
	LL n,m;
	LL i,j,k;
	LL a,b,c,d;
	LL p,q,r;
	LL s=0;
	cin>>n>>p>>q>>r;
	kai[0]=1;
	for(i=1;i<(1<<n);i++){
		kai[i]=kai[i-1]*i;
		if(kai[i]>=MAX)kai[i]%=MAX;
	}
	for(a=0;a<n;a++){
		if(p<(1<<a))break;
	}
	for(b=0;b<n;b++){
		if(q<(1<<b))break;
	}
	c=abs(a-b);
	if(r<c || (r-c)%2==1){
		cout<<0<<endl;
		return 0;
	}
	d=(r-c)/2;
	if(d==0)s=1<<c;
	else{
		s=1<<(d-1);
		s*=(1<<(c+d-1));
		s*=2;
		if(s>=MAX)s%=MAX;
	}
	c=min(a,b)-d;
	s*=1<<(c-1);
	if(s>=MAX)s%=MAX;
	for(i=0;i<n;i++){
		c=1<<i;
		if(a==i+1)c--;
		if(b==i+1)c--;
		s*=kai[c];
		if(s>=MAX)s%=MAX;
	}
	cout<<s<<endl;
}