#include <bits/stdc++.h>
using namespace std;
int dp[32768000];
bool ck[32768000];
int n, m, x;
const int mod = 1e9 + 7;
int go(int u, int t, int o) {
  if (t > n) return 0;
  if (u == m) {
    if (t == n && o == 0) return 1;
    return 0;
  }
  int st = (n + 1) * (n + 1) * u + (n + 1) * t + o;
  if (ck[st]) return dp[st];
  ck[st] = true;
  int ret = 0;
  ret += go(u + 1, t + 1, o + 1);
  if (ret >= mod) ret -= mod;
  ret += go(u + 1, t + 1, o);
  if (ret >= mod) ret -= mod;
  if (x != u) ret += go(u + 1, t, o);
  if (ret >= mod) ret -= mod;
  if (x != u && o > 0) ret += go(u + 1, t, o - 1);
  if (ret >= mod) ret -= mod;
  return dp[st] = ret;
}
int main() {
  cin >> n >> m >> x;
  x--;
  long long ans;
  if (n <= m)
    ans = go(0, 0, 0);
  else
    ans = 0;
  for (int i = 2; i <= n; i++) {
    ans *= i;
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}
