///////////////////////////////////////////////////////////////////////////////

#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <typeinfo>
#include <numeric>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define pb push_back
#define V vector
#define M unordered_map
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)

struct UnionFind
{
        unsigned ll *parent, *count, *rank;

        UnionFind(unsigned ll n) {
                parent = new unsigned ll[n+1];
                count = new unsigned ll[n+1];
                rank = new unsigned ll[n+1];
                for (unsigned ll i = 0UL; i < n+1; ++i) {
                        parent[i] = i;
                        count[i] = 1;
                        rank[i] = 0;
                }
        }

        unsigned ll root(unsigned ll i) {
                if (parent[i] == i) return i;
                parent[i] = root(parent[i]);
                return parent[i];
        }

        void unite(unsigned ll i, unsigned ll j) {
                unsigned ll rooti = root(i);
                unsigned ll rootj = root(j);

                if (rooti == rootj) return;

                if (rank[rootj] < rank[rooti]) {
                        parent[i] = parent[j] = parent[rootj] = rooti;
                        count[rooti] += count[rootj];
                }
                else {
                        parent[i] = parent[j] = parent[rooti] = rootj;
                        count[rootj] += count[rooti];
                        if (rank[rootj] == rank[rooti]) rank[rootj]++;
                }
        }

        bool same(unsigned ll i, unsigned ll j) {
                return root(i) == root(j);
        }
};

void llin(ll &a)
{
        cin >> a;
}

void llinl1(auto &v, ll count)
{
        for (ll i = 0; i < count ; ++i) {
                ll a;
                cin >> a;
                v.push_back(a);
        }
}

void llinl2(auto &v, ll count)
{
        for (ll i = 0; i < count ; ++i) {
                ll a, b;
                cin >> a >> b;
                v.push_back(tuple<ll, ll>(a, b));
        }
}

void llinl3(auto &v, ll count)
{
        for (ll i = 0; i < count ; ++i) {
                ll a, b, c;
                cin >> a >> b >> c;
                v.push_back(tuple<ll, ll, ll>(a, b, c));
        }
}

void llina(auto &v, ll count)
{
        llinl1(v, count);
}

template <typename T>
T min(const V<T> v)
{
        T ret = v[0];
        for (auto i : v) ret = min(ret, i);
        return ret;
}

template <typename T>
T max(const V<T> v)
{
        T ret = v[0];
        for (auto i : v) ret = max(ret, i);
        return ret;
}

ll mod_pow(ll base, ll exp, ll mod)
{
        ll ret = 1;

        for ( ; exp; ) {
                if (exp & 1) {
                        ret *= base;
                        ret %= mod;
                }
                base = (base * base) % mod;
                exp >>= 1;
        }

        return ret;
}

ll mod_inv(ll x, ll mod)
{
        // available only when mod is prime
        return mod_pow(x, mod - 2, mod);
}

template <typename T>
void sort(V<T> &v)
{
        sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
        sort(v.begin(), v.end(), greater<T>());
}

void get_divisors(V<ll> &retlist, ll x)
{
        for (int i = 1; i < sqrt(x) + 3; ++i) {
                if (x % i == 0) {
                        retlist.push_back(i);
                        retlist.push_back(x / i);
                }
        }
}


void get_factors(V<ll> &retlist, ll x)
{
        for (ll i = 2LL; i < (ll)(sqrt(x)) + 3LL; ++i) {
                while (x % i == 0LL) {
                        retlist.pb(i);
                        x /= i;
                }
        }
        retlist.pb(x);
}

template <typename T>
void intersection(const set<T> &a, const set<T> &b,
                  set<T> &result)
{
        V<T> resultlist;

        set_intersection(a.begin(), a.end(),
                         b.begin(), b.end(),
                         back_inserter(resultlist));

        set<T> resultset(resultlist.begin(), resultlist.end());
        result = resultset;
}

unsigned ll combination(ll x, ll y)
{
        if (y > x / 2L) y = x - y;

        unsigned ll ret = 1;
        for (int i = 0; i < y; ++i) {
                ret *= x--;
                ret /= (i + 1);
        }

        return ret;
}

void make_linklist(const V<tuple<ll, ll>> &srclist, V<V<ll>> &dstlist)
{
        for (auto src : srclist) {
                ll a = get<0>(src);
                ll b = get<1>(src);
                dstlist[a].pb(b);
                dstlist[b].pb(a);
        }
}

void debug_print(auto xlist)
{
        for (auto x : xlist) cout << "-- " << x << endl;
}

///////////////////////////////////////////////////////////////////////////////

ll mod = 1000000007LL;
ll f_cache_white[10] = {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1};
ll f_cache_black[10] = {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1};

ll f(ll n)
{
        if (n <= 0) return 1;
        if (f_cache_white[n] >= 0 && f_cache_black[n] >= 0)
                return f_cache_white[n] + f_cache_black[n];

        rep (i, n+1) {
                if (i == 0) continue;
                if (i == 1) {
                        f_cache_white[1] = f_cache_black[1] = 1;
                        continue;
                }
                f_cache_white[i] = f_cache_white[i-1] + f_cache_black[i-1];
                f_cache_black[i] = f_cache_white[i-1];
        }

        return f_cache_white[n] + f_cache_black[n];
}

int main()
{
        ll h, w, k;
        llin(h); llin(w); llin(k);

        ll counts[h+1][w+2];

        counts[0][1] = 1;
        rep (i, w) counts[0][i+2] = 0;

        rep (i, h+1) {
                if (i == 0) continue;
                rep (j, w+2) counts[i][j] = 0;
                rep (j, w+1) {
                        if (j == 0) continue;
                        if (j == 1) {
                                ll tmp = 0;
                                tmp += (counts[i-1][j] * f(w-2LL)) % mod;
                                tmp %= mod;
                                tmp += (counts[i-1][j+1] * f(w-3LL)) % mod;
                                tmp %= mod;
                                counts[i][j] = tmp;
                        }
                        else if (j == w) {
                                ll tmp = 0;
                                tmp += (counts[i-1][j] * f(w-2LL)) % mod;
                                tmp %= mod;
                                tmp += (counts[i-1][j-1] * f(w-3LL)) % mod;
                                tmp %= mod;
                                counts[i][j] = tmp;
                        }
                        else {
                                ll tmp = 0;
                                tmp += ((counts[i-1][j] * f(j-2LL))%mod * f(w-j-1LL)) % mod;
                                tmp %= mod;
                                tmp += ((counts[i-1][j-1] * f(j-3LL))%mod * f(w-j-1LL)) % mod;
                                tmp %= mod;
                                tmp += ((counts[i-1][j+1] * f(j-2LL))%mod * f(w-j-2LL)) % mod;
                                tmp %= mod;
                                counts[i][j] = tmp;
                        }
                }
        }

        cout << counts[h][k];

        return 0;
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 256