#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x, pos;
  cin >> n >> x >> pos;
  int l = 0, r = n;
  int a = x - 1, b = n - x;
  long long ans = 1;
  const int mod = 1e9 + 7;
  while (l < r) {
    int mid = (l + r) / 2;
    if (mid < pos) {
      l = mid + 1;
      ans = (ans * a) % mod;
      a--;
    } else if (mid == pos) {
      l = mid + 1;
    } else {
      r = mid;
      ans = (ans * b) % mod;
      b--;
    }
  }
  for (int i = 1; i <= a + b; i++) {
    ans = (ans * i) % mod;
  }
  cout << ans << endl;
  return 0;
}
