#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x, pos;
  cin >> n >> x >> pos;
  long long mod = 1e9 + 7;
  long long ans = 1;
  int left = 0;
  int right = n;
  int small = 0;
  int big = 0;
  while (left < right) {
    int mid = (left + right) / 2;
    if (mid == pos) {
      left = mid + 1;
    } else if (mid > pos) {
      big++;
      right = mid;
    } else {
      small++;
      left = mid + 1;
    }
  }
  for (int i = 0; i < small; i++) {
    long long val = x - 1 - i;
    ans *= val;
    ans %= mod;
  }
  for (int i = 0; i < big; i++) {
    long long val = n - x - i;
    ans *= val;
    ans %= mod;
  }
  long long baki = n - small - big - 1;
  for (int i = 2; i <= baki; i++) {
    ans *= i;
    ans %= mod;
  }
  cout << ans << endl;
}
