#include <bits/stdc++.h>

using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
//const int mod=998244353;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& 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 Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<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;
    }
};
using mint = Fp<1000000007>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int h,w,k;cin >>h>>w>>k;
    k--;
    vector<vector<mint>>dp(h+1,vector<mint>(w,0));
    dp[0][0]=1;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < (1 << w-1); ++j) {
            bool flg=false;
            vector<bool>ch(w,false);
            for (int l = 0; l < w-1; ++l) {
                if(1&(j>>l)){
                    ch[l]=true;
                }
            }
            for (int l = 0; l < w-1; ++l) {
                if(ch[l] and ch[l+1])flg=true;
            }
            if(flg)continue;
            for (int m = 0; m < w; ++m) {
                if(m==0){
                    if(ch[m]){
                        dp[i+1][m+1]+=dp[i][m];
                    }
                    else {
                        dp[i+1][m]+=dp[i][m];
                    }
                }
                else {
                    if(ch[m]){
                        dp[i+1][m+1]+=dp[i][m];
                    }
                    else if(ch[m-1]){
                        dp[i+1][m-1]+=dp[i][m];
                    }
                    else {
                        dp[i+1][m]+=dp[i][m];
                    }
                }
            }
        }
    }

    cout <<dp[h][k]<<endl;
}


Measured memory_bytes: 3660