#include<bits/stdc++.h>

using namespace std;

#define debug(n) cerr << #n << ':' << n << endl;
#define dline    cerr << __LINE__ << endl;

using ll = long long;
template<class T, class U> using P = pair<T,U>;
template<class T> using Heap = priority_queue<T>;
template<class T> using heaP = priority_queue<T,vector<T>,greater<T>>;
template<class T,class U> using umap = unordered_map<T,U>;
template<class T> using uset = unordered_set<T>;

template<class T>
bool ChangeMax(T&a,const T&b){
  if(a >= b) return false;
  a = b;    return true;
}

template<class T>
bool ChangeMin(T&a,const T&b){
  if(a <= b) return false;
  a = b;    return true;  
}

template<class T, size_t N, class U>
void Fill(T (&a)[N], const U&v){
    fill((U*)a,(U*)(a+N),v);
}

template<class T>
istream& operator >> (istream&is, vector<T>&v){
  for(auto&e:v)is >> e;
  return is;
}

template<long long mod>
class modint{
private:
  long long num;
  long long extgcd(long long a, long long b, long long&x, long long&y)const {
    long long d = a;
    if(b != 0){d = extgcd(b, a%b, y, x);  y -= (a/b) * x;}
    else{x = 1; y = 0;}
    return d;
  }
  long long modinverse()const{
    long long x, y;
    extgcd(num, mod, x, y);
    return (mod + x%mod)%mod;
  }
public:
  modint():num(0){}
  modint(const long long x):num((x < 0?(x+mod):x)%mod ){}
  friend modint operator+(const modint&a, const modint&b)
  {    return modint(a.num + b.num);  }
  friend modint operator-(const modint&a, const modint&b)
  {    return modint(a.num - b.num);  }
  friend modint operator*(const modint&a, const modint&b)
  {    return modint(a.num * b.num);  }
  friend modint operator/(const modint&a, const modint&b)
  {    return modint(a*b.modinverse());  }
  modint& operator+=(const modint&b)
  {    return (*this) = (*this) + b;  }
  modint& operator-=(const modint&b)
  {    return (*this) = (*this) - b;  }
  modint& operator*=(const modint&b)
  {    return (*this) = (*this) * b;  }
  modint& operator/=(const modint&b)
  {    return (*this) = (*this) / b;  }
  modint& operator++()
  {    (*this)+=1; return (*this);  }
  modint& operator--()
  {    (*this)-=1; return (*this);  }
  modint operator++(int){
    modint tmp(*this);
    ++(*this);
    return tmp;
  }
  modint operator--(int){
    modint tmp(*this);
    --(*this);
    return tmp;
  }    
  modint pow(unsigned long long i){
    if(i == 0) return 1;
    if(i & 1){
      return (*this) * (this->pow(i-1));
    }
    modint<mod>hpow = (this->pow(i>>1));
    return hpow * hpow;
  }
  friend ostream& operator<<(ostream&os, const modint&a){
    os << a.num;
    return os;
  }
  friend istream& operator>>(istream&is, modint&a){
    long long x; is >> x;
    a = x;
    return is;
  }
};

constexpr int mod = 1'000'000'007;
using mint = modint<mod>;

int h,w,k;
map<P<int,int>,mint> mp;

mint Rec(int cnt,int pos){
  static mint dp[101][9];
  static bitset<9> used[101];
  if(pos < 1 || pos > w) return 0;
  if(cnt == 0)return pos == k;
  if(used[cnt][pos]) return dp[cnt][pos];
  used[cnt][pos] = 1;
  mint ret = 0;
  for(int i = -1; i <= 1; ++i){
    ret += Rec(cnt-1,pos+i)*mp[{pos,pos+i}];
  }
  return dp[cnt][pos] = ret;
}

int main(){
  cin >> h >> w >> k;
  for(int i = 0; i < (1<<(w-1)); ++i){
    if([&]{
	 int b = 3;
	 for(int j = 0; j < w; ++j){
	   if((i&b) == b) return true;
	   b <<= 1;
	 }
	 return false;
       }())continue;
    int b = 1,c = 1;
    for(int j = 0; j < w; c <<= 1, b <<= 1, ++j){
      if(c == 2)c = 3;
      if(i&b){mp[{j+1,j+2}]++;mp[{j+2,j+1}]++;}
      if((i&c) == 0) mp[{j+1,j+1}]++;
    }
  }
  // for(auto e:mp){
  //   cerr << e.first.first << ':' << e.first.second << ':' << e.second << endl;      
  // }
  cout << Rec(h,1) << endl;
}


Measured memory_bytes: 3592