#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using P = pair<ll, ll>;

const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;

#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

ll dp[110][10]{};

int main(int argc, char **argv)
{
	ll H, W, K; cin >> H >> W >> K;

	**dp = 1;

	REP(h, H)REP(w, W)
	{
		REP(bits, (1ll<<(W-1)))
		{
			bool ok{true};
			REP(ww, W-2)
			{
				if ((bits & (1ll<<ww)) && (bits & (1ll<<(ww+1))))
					ok = false;
			}
			if (!ok) continue;

			if (w >= 1 && (bits & (1ll<<(w-1))))
				(dp[h+1][w-1] += dp[h][w]) %= MOD;
			else if (w <= W-2 && (bits & (1ll<<w)))
				(dp[h+1][w+1] += dp[h][w]) %= MOD;
			else
				(dp[h+1][w] += dp[h][w]) %= MOD;
		}
	}

	std::cout << dp[H][K-1] << std::endl;
}
