#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9+7;
void add(ll &a,ll b){
	a+=b;
	if(a>=mod)a-=mod;
}
int main(void){
	int H,W,K;
	cin >> H >> W >> K;
	--K;
	vector<vector<ll>> dp(H+1,vector<ll>(W,0));
	dp[0][0] =1;
	for(int i=0;i<H;i++){
		for(int j=0;j<W;j++){
			for(int bit=0;bit < 1<<(W-1);bit++){
				bool ok = true;
				for(int k=0;k<W-2;k++){
					if((bit&(1<<k)&&(bit&(1<<(k+1)))))ok=false;
				}
				if(!ok)continue;
				int nj = j;
				if(bit&(1<<j))nj=j+1;
				else if(j>0 &&(bit&(1<<(j-1))))nj=j-1;
				add(dp[i+1][nj],dp[i][j]);
			}
		}
	}
	cout << dp[H][K] << endl;
}