#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <random>
#include <iomanip>

using namespace std;
using P = pair<long, long>;

typedef long long int ll;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))

#define fillInt(xs, x)        \
  for (int i = 0; i < (x); i++) \
    scanf("%d", &xs[i]);
#define fillLong(xs, x)       \
  for (int i = 0; i < (x); i++) \
    scanf("%ld", &xs[i]);
#define fillString(xs, x)       \
  for (int i = 0; i < (x); i++) \
    cin >> xs[i];
#define sortv(xs) sort(xs.begin(), xs.end())
#define sortvinv(xs) sort(xs.begin(), xs.end(), std::greater<long>())
#define lbv(xs, x) lower_bound(xs.begin(), xs.end(), x) - xs.begin()
#define ubv(xs, x) upper_bound(xs.begin(), xs.end(), x) - xs.begin()
#define bs(xs, x) binary_search(xs.begin(), xs.end(), x)
#define index_of(as, x) \
  distance(as.begin(), lower_bound(as.begin(), as.end(), x))

#define rep(i,n) for(int i=0; i<(int)(n); i++)

const int mod = 1000000007;

struct mint {
    ll x;
    mint(ll x=0):x(x%mod){}

    mint& operator+=(const mint a) {
        if((x += a.x) >= mod) x -= mod;
        return *this;
    }

    mint& operator-=(const mint a) {
        if((x -= mod-a.x) >= mod) x -= mod;
        return *this;
    }

    mint& operator*=(const mint a) {
        x = (x * a.x) % mod;
        return *this;
    }

    mint& operator/=(const mint a) {
        *this *= a.inv();
        return *this;
    }

    mint operator+(const mint a) const {
        mint res(*this);
        return res += a;
    }

    mint operator-(const mint a) const {
        mint res(*this);
        return res -= a;
    }

    mint operator*(const mint a) const {
        mint res(*this);
        return res *= a;
    }

    mint operator/(const mint a) const {
        mint res(*this);
        return res /= a;
    }

    mint pow(ll n) const {
        mint a(*this);
        mint res = 1;
        while (n > 0) {
            if (n & 1) res *= a;
            a *= a;
            n >>= 1;
        }
        return res;
    }

    mint inv() const {
        return pow(mod - 2);
    }
};

mint dp[105][8];

long validYoko[8][10];

long calcYoko(int sz, int idx) {
  if (validYoko[sz][idx] != -1) {
    return validYoko[sz][idx];
  }
  long res;
  if (idx >= sz) {
    res = 1;
  } else if (idx == sz - 1) {
    res = 2;
  } else {
    res = (calcYoko(sz, idx+1) + calcYoko(sz, idx+2));
  }
  validYoko[sz][idx] = res;
  return res;
}

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

  int h, w, k;
  cin >> h >> w >> k;

  rep(i, 8) rep(j, 10) {
    validYoko[i][j] = -1;
  }

  dp[0][0] = 1;
  for(int i = 1; i < h+1; i++) {
    rep(j, w) {
      {
        long leftYoko = calcYoko(max(j-1, 0), 0);
        long rightYoko = calcYoko(max(w-j-2, 0), 0);
        dp[i][j] += dp[i-1][j] * leftYoko * rightYoko;
      }
      if(j > 0) {
        long leftYoko = calcYoko(max(j-2, 0), 0);
        long rightYoko = calcYoko(max(w-j-2, 0), 0);
        dp[i][j] += dp[i-1][j-1] * leftYoko * rightYoko;
      }
      if(j < w-1) {
        long leftYoko = calcYoko(max(j-1, 0), 0);
        long rightYoko = calcYoko(max(w-j-3, 0), 0);
        dp[i][j] += dp[i-1][j+1] * leftYoko * rightYoko;
      }
    }
  }

  cout << dp[h][k-1].x << endl;
}


Measured memory_bytes: 256