#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template<int mod>
struct ModInt{
    int x;

    ModInt() : x(0) {}
    
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    
    ModInt &operator+=(const ModInt &p){
        if((x += p.x) >= mod)   x -= mod;
        return *this;
    }
    
    ModInt &operator-=(const ModInt &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p){
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p){
        *this *= p.inverse();
        return *this;
    }
    
    ModInt operator-() const {return ModInt(-x);}

    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 x == p.x;}

    bool operator!=(const ModInt &p) const {return x != p.x;}

    ModInt inverse() const{
        int a = x, 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(int64_t n) const{
        ModInt ret(1), mul(x);
        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.x;
    }

    friend istream &operator>>(istream &is, ModInt &a){
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() {return mod;}
};

using modint = ModInt<mod>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int h, w, k;
    cin >> h >> w >> k;
    if(w == 1){
        cout << 1 << endl;
        return 0;
    }
    --k;
    vector<vector<modint>> dp(h + 1, vector<modint>(w));
    dp[0][0] = 1;
    for(int i = 0; i < h; ++i){
        for(int bit = 0; bit < (1 << (w - 1)); ++bit){
            vector<int> bitpop;
            for(int j = 0; j < w - 1; ++j){
                if((bit >> j) & 1)  bitpop.emplace_back(j);
            }
            int n = bitpop.size();
            bool ok = true;
            for(int j = 0; j + 1 < n; ++j){
                if(bitpop[j] + 1 == bitpop[j + 1])  ok = false;
            }
            if(!ok) continue;
            vector<bool> used(w, false);
            for(int j : bitpop){
                dp[i + 1][j + 1] += dp[i][j];
                dp[i + 1][j] += dp[i][j + 1];
                used[j] = true;
                used[j + 1] = true;
            }
            for(int j = 0; j < w; ++j){
                if(used[j]) continue;
                dp[i + 1][j] += dp[i][j];
            }
        }
    }
    // cerr << right << setw(14) << 0 << ' ';
    // for(int i = 1; i < w; ++i){
    //     cerr << right << setw(10) << i << ' ';
    // }
    // cerr << endl;
    // for(int i = 0; i <= h; ++i){
    //     cerr << right << setw(3) << i << ' ';
    //     for(int j = 0; j < w; ++j){
    //         cerr << right << setw(10) << dp[i][j] << ' ';
    //     }
    //     cerr << endl;
    // }
    cout << dp[h][k] << endl;
}

Measured memory_bytes: 256