#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;


int main(void) {
	int h, w, k, i, j, l, dp[103][10] = {};
	const int mod = 1e9 + 7;

	cin >> h >> w >> k;

	dp[0][0] = 1;
	for (i = 1; i <= h; i++) {
		for (j = 0; j < (1 << (w - 1)); j++) {
			for (l = 0; l < w - 2; l++) {
				if (((j >> l) & 1) == 1 && ((j >> (l + 1)) & 1) == 1) {
					break;
				}
			}
			if (l < w - 2) continue;
			for (l = 0; l < w; l++) {
				int& dpn = dp[i][l];
				if (l > 0 && ((j >> (l - 1)) & 1) == 1) {
					dpn = (dpn + dp[i - 1][l - 1]) % mod;
				}
				else if (l < w - 1 && ((j >> l) & 1) == 1) {
					dpn = (dpn + dp[i - 1][l + 1]) % mod;
				}
				else {
					dpn = (dpn + dp[i - 1][l]) % mod;
				}
			}
		}
	}

	cout << dp[h][k - 1] << endl;

	return 0;
}