#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;

int main(){
  int h,w,k;
  cin>>h>>w>>k;
  int f[10]={1,1,2,3,5,8,13,21,34,55};
  ll dp[h+1][w];
  rep(i,0,h+1){
    rep(j,0,w){
      dp[i][j]=0;
    }
  }
  dp[0][0]=1;
  rep(i,0,h){
    rep(j,0,w){
      dp[i+1][j]+=dp[i][j]*f[j]*f[w-1-j];
      if(j!=w-1) dp[i+1][j]+=dp[i][j+1]*f[j]*f[w-2-j];
      if(j!=0) dp[i+1][j]+=dp[i][j-1]*f[j-1]*f[w-1-j];
      dp[i+1][j]%=mod;
    }
  }
  cout<<dp[h][k-1]<<endl;
}