#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
double dot(complex<double> a, complex<double> b) {
	return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
	return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
	return sqrt(a.real()*a.real() + a.imag()*a.imag());
}
double angles(complex<double> a, complex<double> b) {
	double cosine = dot(a, b) / (leng(a) * leng(b));
	double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
	double kaku = acos(cosine);
	if (sine <= 0) {
		kaku = 2 * Ma_PI - kaku;
	}
	return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
	vector<int> ans;
	double now_minnest = a[0].real();
	int now_itr = 0;
	REP(i, a.size()) {
		if (now_minnest > a[i].real()) {
			now_minnest = a[i].real();
			now_itr = i;
		}
	}
	ans.push_back(now_itr);
	complex<double> ba(0, 1);
	while (true) {
		int now_go = 0;
		double now_min = 0;
		int starter = ans[ans.size() - 1];
		for (int i = 0; i < a.size(); ++i) {
			if (i != starter) {
				double goa = angles(ba, a[i] - a[starter]);
				if (goa > now_min) {
					now_min = goa;
					now_go = i;
				}
			}
		}
		if (now_go == ans[0]) break;
		ans.push_back(now_go);
		ba = complex<double>(a[now_go] - a[starter]);
	}
	return ans;
}
#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1000000007;

void solve(long long H, long long W, long long K){
	vector<vector<long long>> input;
	for (int i = 0; i < (1 << (W-1)); ++i) {
		vector<long long> now;
		int top = i;
		for (int q = 0; q < W; ++q) {
			now.push_back(top % 2);
			top /= 2;
		}
		int tere = 0;
		for (int q = 1; q < W; ++q) {
			if (now[q] == 1 && now[q - 1] == 1) tere = 1;
		}
		if (tere == 0) input.push_back(now);
	}
	long long ans[10] = {};
	ans[0] = 1;
	for (int i = 0; i < H; ++i) {
		int next_ans[10] = {};
		for (int q = 0; q < input.size(); ++q) {
			for (int j = 0; j < W; ++j) {
				if (input[q][j] == 1) {
					next_ans[j + 1] += ans[j];
					next_ans[j + 1] %= MOD;
				}else
				if (j != 0 && input[q][j - 1] == 1) {
					next_ans[j - 1] += ans[j];
					next_ans[j - 1] %= MOD;
				}
				else {
					next_ans[j] += ans[j];
					next_ans[j] %= MOD;
				}
				next_ans[j] %= MOD;
			}
		}
		REP(q, 10) {
			ans[q] = next_ans[q] % MOD;
		}
	}
	cout << ans[K - 1]%MOD << endl;
}

int main(){
    long long H;
    scanf("%lld",&H);
    long long W;
    scanf("%lld",&W);
    long long K;
    scanf("%lld",&K);
    solve(H, W, K);
    return 0;
}


Measured memory_bytes: 256