#include <iostream>
#include <list>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T>
using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())



template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){if(a < b) a = b;}
template <class T> inline void chmin(T &a, T b){if(a > b) a = b;}
template <class T> inline void reverseSORT(Vec<T> &Array){
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k){return 1 << k;}
inline lli BitL(int k){return 1LL << k;}
inline void putsDouble(double d){printf("%.16lf\n", d);}
inline int toInt(const string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res;
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


// f[i][j] := i 個数の間に o が連続しないように入れる方法の数 (j = 右端にある or なし)
Wint f;
void computeF(int n){
    f.resize(n + 1, Vint(2, 0)); f[0][0] = 1;
    for(int i = 0; i < n; ++i){
        f[i + 1][0] = (f[i][0] + f[i][1]) % MOD;
        f[i + 1][1] = f[i][0];
    }
}

int main(void){
    int h, w, k; scanf("%d%d%d", &h, &w, &k);
    Wlli DP(h+1, Vlli(w, 0)); // DP[i][j] := 高さ i において, j 列に行くようなあみだくじの数
    computeF(w + 1);
    DP[0][0] = 1;
    for(int i = 1; i <= h; ++i){
        for(int j = 0; j < w; ++j){
            lli times;
            if(j != 0){
                times = f[j - 1][0]; times *= f[w - j - 1][0]; times %= MOD;
                DP[i][j] += (times * DP[i-1][j-1]) % MOD; DP[i][j] %= MOD;
            }
            times = f[j][0]; times *= f[w - j - 1][0]; times %= MOD;
            DP[i][j] += (times * DP[i-1][j]) % MOD; DP[i][j] %= MOD;
            if(j != w - 1){
                times = f[j][0]; times *= f[w - j - 2][0]; times %= MOD;
                DP[i][j] += (times * DP[i-1][j+1]) % MOD; DP[i][j] %= MOD;
            }
        }
    }
    printf("%lld\n", DP[h][k-1]);
    return 0;
}

Measured memory_bytes: 256