#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=5e18;

int main() {
  ll h,w,k;
  cin >> h >> w >> k;
  ll ans=1;
  mat dp(h+1,vec(w));
  dp[0][0]=1;
  for(ll i=0;i<h;i++) {
    for(ll k=0;k<(1<<(w-1));k++) {
      if((k&k/2)) continue;
      for(ll j=0;j<w;j++) {
        if(j!=w-1&&k>>j&1) {
          (dp[i+1][j]+=dp[i][j+1])%=mod;
        }
        else if(j>0&&k>>(j-1)&1) {
          (dp[i+1][j]+=dp[i][j-1])%=mod;
        }
        else {
          (dp[i+1][j]+=dp[i][j])%=mod;
        }
      }
    }
  }
  cout << dp[h][k-1] << endl;
}