#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, m, x;
long long ans;
int f[400][400], dp[400][400];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m >> x;
  if (n > m) return cout << 0, 0;
  if (x == 1) {
    f[1][1] = 1;
    f[1][0] = 1;
  } else {
    f[0][0] = 1;
    f[1][1] = 1;
    f[1][0] = 1;
  }
  for (int i = 1; i < m; i++) {
    for (int j = 0; j <= n; j++) {
      for (int h = 0; h <= j; h++) {
        if (i + 1 == x) {
          if (h == 0) {
            dp[j + 1][1] += f[j][0];
            dp[j + 1][0] += f[j][0];
            dp[j + 1][1] %= mod;
            dp[j + 1][0] %= mod;
          } else {
            dp[j + 1][h + 1] += f[j][h];
            dp[j + 1][h] += f[j][h];
            dp[j + 1][h + 1] %= mod;
            dp[j + 1][h] %= mod;
          }
        } else {
          if (h == 0) {
            dp[j + 1][1] += f[j][0];
            dp[j + 1][0] += f[j][0];
            dp[j][0] += f[j][0];
            dp[j + 1][1] %= mod;
            dp[j + 1][0] %= mod;
            dp[j][0] %= mod;
          } else {
            dp[j + 1][h + 1] += f[j][h];
            dp[j + 1][h] += f[j][h];
            dp[j][h] += f[j][h];
            dp[j][h - 1] += f[j][h];
            dp[j + 1][h + 1] %= mod;
            dp[j + 1][h] %= mod;
            dp[j][h] %= mod;
            dp[j][j - 1] %= mod;
          }
        }
      }
    }
    for (int j = 0; j <= n; j++) {
      for (int h = 0; h <= j; h++) {
        f[j][h] = dp[j][h] % mod;
        dp[j][h] = 0;
      }
    }
  }
  ans = f[n][0];
  for (int i = 1; i <= n; i++) {
    ans = ans * i;
    ans %= mod;
  }
  cout << ans;
}
