#include <queue>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <string>
#include <vector>
#include <map>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vint;
typedef vector<string> vstr;
typedef pair<ll, ll> pint;
unsigned long long inf = (1LL << 62);
ll mod = 1000000007;
        
//bool operator< (pint a, pint b) {
	//return a.second < b.second;

//}



ll gcd(ll a, ll b) {

	if (b == 0)
		return a;

	return gcd(b, a % b);


}

ll max(ll a, ll b) {
	if (a < b) {
		return b;
	}
	else
		return a;

}

ll min(ll a, ll b) {
	if (a < b)
		return a;

	return b;
}




pint dx[4] = { {1, 0}, {-1, 0}, {0, 1}, {0, -1} };

vector<pint> list;










void floyd(int N, ll** d) {

	rep(k, N+1){
		rep(i, N+1) {
			if (d[i+1][k+1] == inf) continue;
			rep(j, N+1) {
				if (d[j+1][k+1] == inf) continue;

				d[i+1][j+1] = min(d[i+1][j+1], d[i+1][k+1] + d[j+1][k+1]);

			}

		}
	}




}


ull modpow(ull a, ull b) {
	ll retval = 0;

	if (b == 0) { return 1; }

	else if (b % 2 == 0) {
		retval = modpow(a, b / 2) % mod;
		return (retval * retval) % mod;
	}

	else {
		
		return ((a % mod) * modpow(a, b - 1)) % mod;
	}
}

ull modkaijou(ull a) {

	if (a == 1 || a == 0) { return 1; }

	ll retval = 1;

	for (ull i = a; i >= 1; i--) {
		retval = (retval * (i % mod)) % mod;
	}

	return retval % mod;
}

ull modcomb(ull a, ull b) {

	if (a == 0 || b == 0) return 1;

	return (((modkaijou(a) * modpow(modkaijou(a-b), mod - 2)) % mod) * modpow(modkaijou(b), mod - 2)) % mod;
}


vector<pint> query;

stack<int> to_1;


class DisjointSet {
public:
	vector<int> p, rank, num;


	DisjointSet() {}

	DisjointSet(int size) {
		rank.resize(size, 0);
		p.resize(size, 0);
		num.resize(size, 0);
		rep(i, size) { p[i] = i; rank[i] = 0; num[i] = 1; }
	}

	bool same(int x, int y) {

		return findSet(x) == findSet(y);

	}

	void unite(int x, int y) {
		link(findSet(x), findSet(y));
	}

	void link(int x, int y) {
		if (rank[x] > rank[y]) {

			p[y] = x;
			num[x] += num[y];

		}

		else {
			p[x] = y;
			num[y] += num[x];
			if (rank[x] == rank[y]) {

				rank[y]++;
			}

		}


	}


	ll NumberOfElements(int x) {

		return num[findSet(x)];

	}


	int findSet(int x) {
		if (x != p[x]) {
			p[x] = findSet(p[x]);
			num[x] = 1;
		}

		return p[x];
	}



};











string S;

ll dp[102][9];
ll H, W, K;

ll dfs(ll W, string path, ll from, ll to) {

	if (path.size() == W) {
		path = path + "0";
		for (int i = 1; i < path.size(); i++) {
			if (path[i] == '1' &&  path[i + 1] == '1') {
				return 0;
			}
			if (from != to && path[from] == '0') {
				return 0;
			}

			if (from == to && (path[from] == '1' || path[from-1] == '1') ) {
				return 0;
			}

		}

		return 1;
	}
   
	else {

	return dfs(W, path+"1", from, to) + dfs(W, path + "0", from, to);
	
	}

}


int main() {
	

	cin >> H >> W >> K;

	dp[0][1] = 1;

	if (W == 1) {
		cout << 1 << endl;
		return 0;
	}


	rep(i, H) {
		rep(j, W) {
			
			cerr << dfs(W, "0", j + 1, j + 1) << endl;
			
			if (j != 0 && j != W-1) {
				dp[i + 1][j + 1] = dfs(W, "0", j, j + 1) * dp[i][j] + dfs(W, "0", j + 1, j + 1) * dp[i][j + 1] + dfs(W, "0", j + 1, j + 2) * dp[i][j + 2];
				
			}

			if (j == 0) {
				dp[i + 1][j + 1] = dfs(W, "0", j + 1, j + 1) * dp[i][j + 1] + dfs(W, "0", j + 1, j + 2) * dp[i][j + 2];

				cerr << dfs(W, "0", j + 1, j + 2) << endl;
			}

			if (j == W-1) {
				dp[i + 1][j + 1] = dfs(W, "0", j, j + 1) * dp[i][j] + dfs(W, "0", j + 1, j + 1) * dp[i][j + 1];
			}

			dp[i + 1][j + 1] %= mod;

		}
	}


	cout << dp[H][K] << endl;

	return 0;
}

Measured memory_bytes: 256