#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[1000][100] = {0},cnt[100] = {0},mod = 1000000007,h,w,k;
ll ret(int i){
	if(i>0) return cnt[i];
	return 1;
}
 
int main(){
	int i,j,l;
	cin >> h >> w >> k;
	for(i=0;i<w;i++){
		for(j=0;j<1<<i;j++){
			for(l=0;l<i;l++){
				if(j&1<<l && j&1<<(l+1)){
					break;
				}
				if(l==i-1) cnt[i]++;
			}
		}
	}
	
	dp[0][0] = 1;
	for(i=1;i<=h;i++){
		for(j=0;j<w;j++){
			(dp[i][j] += ret(j-1)*ret(w-j-2)*dp[i-1][j]) %= mod;
			if(j!=0){
				(dp[i][j] += ret(j-2)*ret(w-j-2)*dp[i-1][j-1]) %= mod;
			}
			if(j!=w-1){
				(dp[i][j] += ret(j-1)*ret(w-j-3)*dp[i-1][j+1]) %= mod;
			}
		}
	}
	cout<<dp[h][k-1]<<endl;
}