#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int N = 1e5 + 10;
const long long mod = 1e9 + 7;
const long long mod2 = 998244353;
const long long inf = 8e18;
const int LOG = 22;
const int SQ = 320;
long long pw(long long a, long long b, long long M) {
  return (!b ? 1
             : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M
                      : pw(a * a % M, b / 2, M)));
}
int n, m, x;
vector<int> dp[SQ][SQ];
int add(int a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
int main() {
  long long first = 1;
  scanf("%d%d%d", &n, &m, &x);
  for (int i = 1; i <= n; i++) first = first * i % mod;
  if (n > m) return !printf("0");
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      dp[i][j].resize(m + 1);
    }
  }
  dp[0][0][0] = 1;
  for (int k = 1; k <= m; k++) {
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j <= i; j++) {
        if (i) {
          dp[i][j][k] = dp[i - 1][j][k - 1];
          if (j) dp[i][j][k] = add(dp[i][j][k], dp[i - 1][j - 1][k - 1]);
        }
        if (k == x) continue;
        dp[i][j][k] = add(dp[i][j][k], dp[i][j][k - 1]);
        if (j) dp[i][j][k] = add(dp[i][j][k], dp[i][j - 1][k - 1]);
      }
    }
  }
  printf("%lld", dp[n][n][m] * first % mod);
  return 0;
}
