#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, maxN = 1e5 + 13;
int n, m, x, fac[maxN];
int main() {
  cin >> n >> m >> x;
  if (n > m) return cout << 0 << endl, 0;
  int dp[n + 3][m + 3][n + 3];
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = (1ll * fac[i - 1] * i) % mod;
  memset(dp, 0, sizeof dp);
  for (int i = 0; i < x; i++) dp[0][i][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++)
      for (int o = 0; o <= i; o++) {
        if (j != x)
          dp[i][j][o] = (0ll + dp[i][j - 1][o + 1] +
                         (o > 0 ? dp[i - 1][j - 1][o - 1] : 0) +
                         dp[i][j - 1][o] + dp[i - 1][j - 1][o]) %
                        mod;
        else
          dp[i][j][o] =
              ((o > 0 ? dp[i - 1][j - 1][o - 1] : 0) + dp[i - 1][j - 1][o]) %
              mod;
      }
  }
  cout << (1ll * dp[n][m][0] * fac[n]) % mod << endl;
}
