#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 4;
int t = 1;
long long C[1002][1002];
long long fact[N];
long long binomialCoeff(long long n, long long k) {
  long long i, j;
  if (k > n) return 0;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= min(i, k); j++) {
      if (j == 0 || j == i)
        C[i][j] = 1LL;
      else
        C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007;
    }
  }
  fact[0] = 1;
  for (long long i = 1; i <= 1002; i++) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
  }
  return C[n][k] % 1000000007;
}
void solve() {
  long long n, x, pos;
  cin >> n >> x >> pos;
  long long l = 0, r = n;
  vector<long long> vs, vg;
  while (l < r) {
    long long mid = (l + r) / 2;
    if (mid <= pos) {
      l = mid + 1;
      vs.push_back(mid);
    } else {
      r = mid;
      vg.push_back(mid);
    }
  }
  long long vss = vs.size() - 1, vgg = vg.size();
  long long kk = n - (vss + vgg + 1);
  long long rn = n - x;
  long long temp = (C[(x - 1)][vss] * C[rn][vgg]) % 1000000007;
  temp = (temp * fact[vss]) % 1000000007;
  ;
  temp = (temp * fact[vgg]) % 1000000007;
  temp = (temp * fact[kk]) % 1000000007;
  ;
  cout << temp;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  binomialCoeff(1001, 1001);
  while (t--) {
    solve();
  }
  return 0;
}
