/*
        _            _                  _            _       _     _         _   _          _          _             _        
       / /\         / /\               / /\         / /\    / /\  /\ \      /\_\/\_\ _     /\ \       /\ \     _    /\ \      
      / /  \       / /  \             / /  \       / / /   / / /  \ \ \    / / / / //\_\   \ \ \     /  \ \   /\_\ /  \ \     
     / / /\ \__   / / /\ \           / / /\ \__   / /_/   / / /   /\ \_\  /\ \/ \ \/ / /   /\ \_\   / /\ \ \_/ / // /\ \_\    
    / / /\ \___\ / / /\ \ \         / / /\ \___\ / /\ \__/ / /   / /\/_/ /  \____\__/ /   / /\/_/  / / /\ \___/ // / /\/_/    
    \ \ \ \/___// / /  \ \ \        \ \ \ \/___// /\ \___\/ /   / / /   / /\/________/   / / /    / / /  \/____// / / ______  
     \ \ \     / / /___/ /\ \        \ \ \     / / /\/___/ /   / / /   / / /\/_// / /   / / /    / / /    / / // / / /\_____\ 
 _    \ \ \   / / /_____/ /\ \   _    \ \ \   / / /   / / /   / / /   / / /    / / /   / / /    / / /    / / // / /  \/____ / 
/_/\__/ / /  / /_________/\ \ \ /_/\__/ / /  / / /   / / /___/ / /__ / / /    / / /___/ / /__  / / /    / / // / /_____/ / /  
\ \/___/ /  / / /_       __\ \_\\ \/___/ /  / / /   / / //\__\/_/___\\/_/    / / //\__\/_/___\/ / /    / / // / /______\/ /   
 \_____\/   \_\___\     /____/_/ \_____\/   \/_/    \/_/ \/_________/        \/_/ \/_________/\/_/     \/_/ \/___________/    
                                                                                                                              
*/
#include<bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, n) for(int i = 0;i < (n);++i)

#define endl '\n'
#define pb emplace_back
#define mkp make_pair
#define p_q priority_queue
#define INF 1000000000
#define PI 3.1415926
#define coutdb cout << fixed << setprecision(10)

const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
const int dx_8[]={1,1,0,-1,-1,-1,0,1}, dy_8[]={0,-1,-1,-1,0,1,1,1};
const long long MOD = 1e9+7;

// typedef long long ll;
#define int long long

template <typename T> inline T GCD(T a,T b){T c;while(b!=0){c=a%b;a=b;b=c;}return a;}
template <typename T> inline T LCM(T a,T b){T c=GCD(a,b);a/=c;return a*b;}
template <typename T> inline T nCr(T a,T b){T i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
template <typename T> inline T nHr(T a,T b){return nCr(a+b-1,b);}

int dp[101][10];

signed main(void){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int H, W, K; cin >> H >> W >> K;
  dp[0][1] = 1;

  int cnt[8] = {}, all = 0;
  REP(i, (1<<(W-1))){
    int bit = i; bool combo = 0;
    int tmpcnt[8] = {};
    vector<int> tmp;
    REP(j, W-1){
      tmpcnt[j] = bit%2;
      if(bit%2){
        if(combo) break;
        combo = 1;
      } else {
        combo = 0;
      }
      tmp.pb(bit%2);
      bit /= 2;
    }
    if(tmp.size() == W-1){
      all++;
      REP(j, W-1){
        cnt[j] += tmpcnt[j];
      }
    }
  }

  for(int i = 0; i < H; i++){
    for(int j = 1; j <= W; j++){
      if(j>1 and j<W){
        dp[i+1][j-1] += cnt[j-2]*dp[i][j];
        dp[i+1][j+1] += cnt[j-1]*dp[i][j];
        dp[i+1][j] += (all-cnt[j-2]-cnt[j-1])*dp[i][j];
      } else if(j == 1){
        dp[i+1][j+1] += cnt[j-1]*dp[i][j];
        dp[i+1][j] += (all-cnt[j-1])*dp[i][j];
      } else{
        dp[i+1][j-1] += cnt[j-2]*dp[i][j];
        dp[i+1][j] += (all-cnt[j-2])*dp[i][j];
      }
      dp[i+1][j-1] %= MOD;
      dp[i+1][j] %= MOD;
      dp[i+1][j+1] %= MOD;
    }
  }
  cout << dp[H][K] << endl;
}

Measured memory_bytes: 256