#include <bits/stdc++.h>
using namespace std;
 
 
#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
 
#define INF bit(60)
 
#define DBGP 1
 
 
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
 
#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
 
typedef pair<li, li> PI;
 
li ni[111111];
 
li dp0[110][2];
 
li dp[110][110];
 
li calc0(li x) {
    if (x <= 0)return 1;
    return (dp0[x][0] + dp0[x][1]) % MOD;
}
 
int main() {
    ni[0] = 1;
    repp(i, 1, 1001) {
        ni[i] = (ni[i] * 2) % MOD;
    }
 
    dp0[0][0] = 1;
    dp0[0][1] = 0;
    dp0[1][0] = 1;
    dp0[1][1] = 1;
    repp(i, 2, 10) {
        dp0[i][0] = (dp0[i - 1][0] + dp0[i - 1][1]) % MOD;
        dp0[i][1] = dp0[i - 1][0] % MOD;
    }
 
    li h, w, k;
    cin >> h >> w >> k;
 
    rep(j, w)dp[0][j] = 0;
    dp[0][0] = 1;
    repp(i, 1, h + 1) {
        rep(j, w) {
            dp[i][j] = 0;
            if (j > 0) {
                li tmp = dp[i - 1][j - 1];
                tmp = (tmp * calc0(j - 2)) % MOD;
                tmp = (tmp * calc0(w - j - 2)) % MOD;
                dp[i][j] = (dp[i][j] + tmp) % MOD;
            }
            if (j < w - 1) {
                li tmp = dp[i - 1][j + 1];
                tmp = (tmp * calc0(j - 1)) % MOD;
                tmp = (tmp * calc0(w - j - 3)) % MOD;
                dp[i][j] = (dp[i][j] + tmp) % MOD;
            }
            {
                li tmp = dp[i - 1][j];
                tmp = (tmp * calc0(j - 1)) % MOD;
                tmp = (tmp * calc0(w - j - 2)) % MOD;
                dp[i][j] = (dp[i][j] + tmp) % MOD;
            }
        }
    }
 
    //dump2d(dp, w, h + 1);
 
    cout << dp[h][k - 1] % MOD << endl;
 
    return 0;
}


Measured memory_bytes: 384