#include <bits/stdc++.h>
using namespace std;
const int maxn = 320 + 14, mod = 1e9 + 7;
int n, m, x;
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m >> x;
  if (n > m) return cout << "0\n", 0;
  vector<vector<int> > dp(n + 1, vector<int>(n + 1));
  dp[0][0] = 1;
  for (int i = 1; i <= m; i++) {
    vector<vector<int> > nxt(n + 1, vector<int>(n + 1));
    for (int l = 0; l <= n; l++)
      for (int r = 0; r <= l; r++) {
        if (i != x) (nxt[l][r] += dp[l][r]) %= mod;
        if (l < n) (nxt[l + 1][r] += dp[l][r]) %= mod;
        if (i != x && l > r) (nxt[l][r + 1] += dp[l][r]) %= mod;
        if (l < n && r < n) (nxt[l + 1][r + 1] += dp[l][r]) %= mod;
      }
    dp = nxt;
  }
  int ans = dp[n][n];
  for (int i = 1; i <= n; i++) ans = (long long)ans * i % mod;
  cout << ans << '\n';
}
