#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define MOD 1000000007
int h, w, k;
ll g[111], f[111][11];
ll dg(int a){
	if(a < 0) return 1;
	return g[a];
}
int main(){
	scanf("%d %d %d", &h, &w, &k);
	g[0] = 1, g[1] = 1, g[2] = 2;
	f[0][1] = 1;
	for(int i = 3; i <= 10; i++) g[i] = (g[i - 1] + g[i - 2]) % MOD;
	for(int i = 1; i <= h; i++)
		for(int j = 1; j <= w; j++){
			f[i][j] += f[i - 1][j - 1] * dg(j - 2) % MOD * dg(w - j);
			f[i][j] += f[i - 1][j + 1] * dg(j - 1) % MOD * dg(w - j - 1);
			f[i][j] += f[i - 1][j] * dg(j - 1) % MOD * dg(w - j);
			f[i][j] %= MOD;
		//	printf("%d %d %lld\n", i, j, f[i][j]);
		}
	printf("%lld\n", f[h][k]);
	return 0;
}
