// D - Number of Amidakuji

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct ModInt {
	long long val;
	constexpr ModInt(long long v = 0) noexcept : val(v % MOD) {
		if (val < 0) val += MOD;
	}
	constexpr int getmod() { return MOD; }
	constexpr ModInt operator - () const noexcept {
		return val ? MOD - val : 0;
	}
	constexpr ModInt operator + (const ModInt& r) const noexcept { return ModInt(*this) += r; }
	constexpr ModInt operator - (const ModInt& r) const noexcept { return ModInt(*this) -= r; }
	constexpr ModInt operator * (const ModInt& r) const noexcept { return ModInt(*this) *= r; }
	constexpr ModInt operator / (const ModInt& r) const noexcept { return ModInt(*this) /= r; }
	constexpr ModInt& operator += (const ModInt& r) noexcept {
		val += r.val;
		if (val >= MOD) val -= MOD;
		return *this;
	}
	constexpr ModInt& operator -= (const ModInt& r) noexcept {
		val -= r.val;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr ModInt& operator *= (const ModInt& r) noexcept {
		val = val * r.val % MOD;
		return *this;
	}
	constexpr ModInt& operator /= (const ModInt& r) noexcept {
		long long a = r.val, b = MOD, u = 1, v = 0;
		while (b) {
			long long t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr bool operator == (const ModInt& r) const noexcept {
		return this->val == r.val;
	}
	constexpr bool operator != (const ModInt& r) const noexcept {
		return this->val != r.val;
	}
	friend constexpr ostream& operator << (ostream &os, const ModInt<MOD>& x) noexcept {
		return os << x.val;
	}
	friend constexpr ModInt<MOD> modpow(const ModInt<MOD> &a, long long n) noexcept {
		if (n == 0) return 1;
		auto t = modpow(a, n / 2);
		t = t * t;
		if (n & 1) t = t * a;
		return t;
	}
};

const int MOD = 1000000007;
using mint = ModInt<MOD>;

int H, W, K;
mint dp[101][9];

ll count_cases_with(int a) {
	int result = 0;
	for (int bits=0; bits<(1<<(W-1)); bits++) {
		if (!(bits & 1<<(a-1))) continue;
		bool valid = true;
		for (int i=0; i<W-1; i++) {
			if ((bits & (1<<i)) && (bits & (1<<(i+1)))) {
				valid = false;
			}
		}
		if (valid) {
			//cout << bitset<8>(bits) << endl; // **** debug ****
			result++;
		}
	}

	return result;
}

ll count_cases_without(int a, int b) {
	int result = 0;
	for (int bits=0; bits<(1<<(W-1)); bits++) {
		if (a >= 1 && (bits & 1<<(a-1))) continue;
		if (b <= W-1 && (bits & 1<<(b-1))) continue;
		bool valid = true;
		for (int i=0; i<W-1; i++) {
			if ((bits & (1<<i)) && (bits & (1<<(i+1)))) {
				valid = false;
			}
		}
		if (valid) {
			//cout << bitset<8>(bits) << endl; // **** debug ****
			result++;
		}
	}

	return result;
}

int main() {
	cin >> H >> W >> K;

	dp[0][1] = 1;

	for (int h=0; h<=H; h++) {
		for (int w=1; w<=W; w++) {
			if (dp[h][w] == 0) continue;

			if (w != 1) {
				dp[h+1][w-1] += dp[h][w] * count_cases_with(w-1);
			}

			dp[h+1][w] += dp[h][w] * count_cases_without(w-1, w);

			if (w != W) {
				dp[h+1][w+1] += dp[h][w] * count_cases_with(w);
			}
		}
	}

	// **** debug ****
	/*
	for (int h=0; h<=H; h++) {
		cout << "h=" << h << ":";
		for (int w=1; w<=W; w++) {
			cout << " " << dp[h][w];
		}
		cout << endl;
	}
	*/

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

	return 0;
}

Measured memory_bytes: 3640