#include <bits/stdc++.h>
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define rep(i,n) FOR(i,0,n)
using namespace std;
typedef long long ll;
const ll mod=1e9+7;

ll h,w,k,dp[109][10],fib[100];

ll fibo(ll x){
    if(x<=2)return 1;
    if(fib[x])return fib[x];
    return fib[x]=fibo(x-2)+fibo(x-1);
}

int main(){
    cin>>h>>w>>k;
    dp[0][1]=1;
    rep(i,h){
        FOR(j,1,w+1){
            (dp[i+1][j-1]+=dp[i][j]*fibo(j-1)*fibo(w-j+1))%=mod;
            (dp[i+1][j]+=dp[i][j]*fibo(j)*fibo(w-j+1))%=mod;
            (dp[i+1][j+1]+=dp[i][j]*fibo(j)*fibo(w-j))%=mod;
        }
    }
    cout<<dp[h][k]<<endl;
}