#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>

#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x)  cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR 
#endif
using namespace std;

using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;

//struct edge {int from, to, cost;};

constexpr double EPS = 1e-10;
//constexpr double PI  = acos(-1.0);
//constexpr int INF = INT_MAX;
constexpr int MOD = 1'000'000'007;

template<class T> inline T sqr(T x) {return x*x;}

long long power(long long x, long long n, long long mod = MOD) {
    if (n <= 0) return 1;
    if (n % 2 == 0) return power(x * x % mod, n/2, mod);
    else return x * power(x, n-1, mod) % mod;
}

void solve() {
    int h,w,k;
    cin >> h >> w >> k;
    LL dp[102][8] = {};
    VI pa(9);
    pa[0] = 1;
    pa[1] = 2;
    REP(i,2,9) pa[i] = pa[i-2] + pa[i-1];
    dp[0][0] = 1;
    if (w == 1) {
        cout << 1 << endl;
        return;
    }
    REP(i,0,h) {
        REP(j,0,w) {
            if (j == 0) {
                dp[i+1][j] += dp[i][0] * pa[w-2];
                dp[i+1][j] %= MOD;
                dp[i+1][j] += dp[i][1] * pa[max(0,w-3)];
                dp[i+1][j] %= MOD;                
            } else if (j == w - 1) {
                dp[i+1][j] += dp[i][w-1] * pa[w-2];
                dp[i+1][j] %= MOD;
                dp[i+1][j] += dp[i][w-2] * pa[max(0,w-3)];
                dp[i+1][j] %= MOD;
            /*                    
            } else if (j == 1) {
                dp[i+1][j] += dp[i][j] * power(2,w-3);
                dp[i+1][j] %= MOD;                      
                dp[i+1][j] += dp[i][j-1] * power(2,w-3);
                dp[i+1][j] %= MOD;
                dp[i+1][j] += dp[i][j+1] * power(2,w-4);
                dp[i+1][j] %= MOD;   
            } else if (j == w - 2) {
                dp[i+1][j] += dp[i][j] * power(2,w-3);
                dp[i+1][j] %= MOD;                      
                dp[i+1][j] += dp[i][j-1] * power(2,w-4);
                dp[i+1][j] %= MOD;
                dp[i+1][j] += dp[i][j+1] * power(2,w-3);
                dp[i+1][j] %= MOD;  
            */
            } else {
                dp[i+1][j] += dp[i][j] * pa[j-1] * pa[w-j-2];
                dp[i+1][j] %= MOD;
                if (j - 1 == 0) {
                    dp[i+1][j] += dp[i][j-1] * pa[max(0,w-3)];
                } else {
                    dp[i+1][j] += dp[i][j-1] * pa[j-2] * pa[w-j-2];
                }           
                dp[i+1][j] %= MOD;
                if (j + 1 == w - 1) {
                    dp[i+1][j] += dp[i][j+1] * pa[max(0,w-3)];
                } else {
                    dp[i+1][j] += dp[i][j+1] * pa[j-1] * pa[w-j-3];
                }
                dp[i+1][j] %= MOD;     
            }
        }
    }
    cout << dp[h][k-1] << endl;
    /*
    REP(i,0,h) {
        REP(j,0,w) cout << dp[i+1][j] << " ";
        cout << endl;
    }
    */
}

int main() {
    solve();
    
    return 0;
}

Measured memory_bytes: 256