#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long mod = 1e9 + 7;
const int mxN = 2e5 + 9;
const int INF = 2e9;
long long fact[1009];
int n, x, pos;
int mult(int a, int b) {
  long long a1 = ((long long)a) % MOD;
  long long b1 = ((long long)b) % MOD;
  return (int)((a1 * b1) % MOD);
}
int pow(int a, int b) {
  int res = 1;
  while (b > 0) {
    if (b % 2 == 1) res = mult(res, a);
    a = mult(a, a);
    b /= 2;
  }
  return res;
}
int inv(int n) { return pow(n, MOD - 2); }
int nCr(int n, int r) {
  if (n < r) return 0;
  return mult(fact[n], inv(mult(fact[r], fact[n - r])));
}
int subt(int a, int b) { return (((a - b) % MOD) + MOD) % MOD; }
void solve() {
  cin >> n >> x >> pos;
  fact[0] = fact[1] = 1;
  for (long long i = 2; i <= n; i++) fact[i] = (fact[i - 1] * i) % MOD;
  int need_more = 0, need_less = 0;
  int L = 0, R = n;
  while (L < R) {
    int mid = (L + R) / 2;
    if (mid <= pos) {
      L = mid + 1;
      need_less += 1;
    } else {
      R = mid;
      need_more += 1;
    }
  }
  need_less -= 1;
  if (need_more > n - x || need_less > x - 1) {
    cout << 0 << "\n";
    return;
  }
  int r1 = mult(nCr(x - 1, need_less), fact[need_less]);
  int r2 = mult(nCr(n - x, need_more), fact[need_more]);
  int r3 = fact[n - need_less - need_more - 1];
  cout << mult(r1, mult(r2, r3));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
