#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;

const int INF = 2100100100;
const int MOD = 1e9 + 7;

// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template <int mod> struct ModInt {
    int val;
    ModInt() : val(0) {}
    ModInt(long long x) : val(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {
        if ((val += p.val) >= mod) {
            val -= mod;
        }
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if ((val += mod - p.val) >= mod) {
            val -= mod;
        }
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        val = (int)(1LL * val * p.val % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
    ModInt operator-() const { return ModInt(-val); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return val == p.val; }
    bool operator!=(const ModInt &p) const { return val != p.val; }
    ModInt inverse() const {
        int a = val, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n) const {
        ModInt ret(1), mul(val);
        while (n > 0) {
            if (n & 1)
                ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.val; }
    friend istream &operator>>(istream &is, ModInt &a) {
        long long t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }
    static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;

vector<modint> fact, fact_inv, inv;
// init_nCk pre calculates fact[], fact_inv[], inv[] for combination
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = modint(1);
    fact_inv[0] = fact_inv[1] = modint(1);
    inv[1] = modint(1);
    for (int i = 2; i < SIZE; i++) {
        fact[i] = fact[i - 1] * modint(i);
        inv[i] = modint(0) - inv[MOD % i] * modint(MOD / i);
        fact_inv[i] = fact_inv[i - 1] * inv[i];
    }
}
//#define NDEBUG
modint nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * fact_inv[k] * fact_inv[n - k];
}

int h, w, k;
vector<vector<modint>> A;

modint solve() {
    A[0][0] = modint(1);

    REP(now_h, h) {
        vector<int> xs = {-1, 0, 1};
        REP(now_w, w) {
            vector<int> magni(3, 0);
            REP(bits, 1 << (w - 1)) {
                bool flug = false;
                REP(i, w - 2) {
                    int mask = 1 << i;
                    if ((mask & bits) && ((mask << 1) & bits)) {
                        flug = true;
                        break;
                    }
                }
                if (flug) {
                    continue;
                }
                int mask = 1 << now_w;
                if (bits & (mask >> 1)) {
                    magni[0]++;
                } else if (bits & (mask)) {
                    magni[2]++;
                } else {
                    magni[1]++;
                }
            }
            REP(i, 3) {
                int next_w = now_w + xs[i];
                int next_h = now_h + 1;

                if (next_w >= 0 && next_w <= w) {
                    A[next_h][next_w] += modint(magni[i]) * A[now_h][now_w];
                }
            }
        }
    }

    return A[h][k];
}

using ll = long long;
int main() {

    cin >> h >> w >> k;
    k--;
    A.resize(h + 1, vector<modint>(w, modint(0))); // h+1 行 w 列

    cout << solve() << endl;

    return 0;
}


Measured memory_bytes: 256