#include <bits/stdc++.h>
const long long int N = 3e5 + 1;
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (max(a, b) / gcd(a, b)) * min(a, b);
}
long long int powermodm(long long int x, long long int n, long long int M) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}
long long int gcdExtended(long long int a, long long int b, long long int *x,
                          long long int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long int modInverse(long long int a, long long int m) {
  long long int x, y;
  long long int g = gcdExtended(a, m, &x, &y);
  if (g != 1)
    return -1;
  else {
    long long int res = (x % m + m) % m;
    return res;
  }
}
bool isPrime(long long int a) {
  if (a == 1) return false;
  if (a == 2) return true;
  if (a % 2 == 0) return false;
  long long int root = sqrt(a);
  for (long long int i = 3; i <= (long long int)root; i += 2) {
    if (a % i == 0) return false;
  }
  return true;
}
int32_t main() {
  long long int n, x, pos;
  cin >> n >> x >> pos;
  long long int ans = 1;
  long long int a = x - 1, b = n - x;
  long long int left = 0, right = n;
  while (left < right) {
    long long int mid = (left + right) / 2;
    if (mid > pos) {
      ans = (ans * b) % 1000000007;
      b--;
      right = mid;
    } else if (mid < pos) {
      ans = (ans * a) % 1000000007;
      a--;
      left = mid + 1;
    } else
      left = mid + 1;
  }
  long long int rem = a + b;
  while (rem) {
    ans = (ans * rem) % 1000000007;
    rem--;
  }
  cout << ans;
}
