#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
  for (char& c : s) c = c == ',' ? ' ' : c;
  stringstream ss;
  ss << s;
  vector<string> res;
  for (string z; ss >> z; res.push_back(z))
    ;
  return res;
}
void debug_out(vector<string> args, int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
  if (idx > 0) cerr << ", ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, T...);
}
void localTest() {}
const long long N = 1e3 + 5, MOD = 1e9 + 7;
long long C[N][N], fac[N];
int main() {
  localTest();
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  fac[0] = 1;
  for (long long i = 1; i < N; ++i) {
    fac[i] = (i * fac[i - 1]) % MOD;
  }
  C[0][0] = C[1][0] = C[1][1] = 1;
  for (long long i = 2; i < N; ++i) {
    C[i][0] = 1;
    for (long long j = 1; j < N; ++j) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
    }
  }
  long long n, x, pos;
  cin >> n >> x >> pos;
  long long small = 0, large = 0;
  long long lo = 0, hi = n;
  while (lo < hi) {
    long long mid = (lo + hi) >> 1;
    if (mid <= pos) {
      small++;
      lo = mid + 1;
    } else {
      large++;
      hi = mid;
    }
  }
  long long rem = n - small - large;
  long long ans = fac[rem];
  ans = (ans * C[x - 1][small - 1]) % MOD;
  ans = (ans * fac[small - 1]) % MOD;
  ans = (ans * C[n - x][large]) % MOD;
  ans = (ans * fac[large]) % MOD;
  cout << ans << "\n";
  return 0;
}
