#include<iostream>
using namespace std;
using ll = long long;

ll mod = 1e9 + 7;
ll dp[110][10]; // dp[h][k] = h段からなり0がkになる組合せ
int h, w, k;

int main(){
    cin >> h >> w >> k;
    dp[0][0] = 1, k--;
    for (int i = 0; i < h; i++){
        for (int j = 0; j < (1 << (w - 1)); j++){
            bool out = true;
            for (int k = 0; k < w - 2; k++){
                if ((j >> k) % 4 == 3)out = false;
            }
            if (!out)continue;
            int p[w];
            for (int k = 0; k < w; k++)p[k] = k;
            for (int k = 0; k < w - 1; k++){
                if ((j >> k) & 1)swap(p[k], p[k + 1]);
            }
            for (int k = 0; k < w; k++){
                dp[i + 1][p[k]] += dp[i][k];
                dp[i + 1][p[k]] %= mod;
            }
        }
    }
    cout << dp[h][k] << endl;
}