#include <bits/stdc++.h>
using namespace std;
void oj() {}
void solve() {
  long long n, x, pos;
  cin >> n >> x >> pos;
  long long mini = x - 1, maxi = n - x;
  long long l = 0, r = n, m = -1;
  long long ans = 1;
  while (l < r) {
    m = (l + r) / 2;
    if (m < pos) {
      ans = (ans * mini) % 1000000007;
      mini--;
      l = m + 1;
    } else if (m == pos)
      l = m + 1;
    else {
      ans = (ans * maxi) % 1000000007;
      maxi--;
      r = m;
    }
  }
  long long temp = mini + maxi;
  for (long long i = 1; i <= temp; i++) ans = (ans * i) % 1000000007;
  cout << ans << endl;
}
signed main() {
  oj();
  ios::sync_with_stdio(0);
  cin.tie(0);
  ;
  solve();
  return 0;
}
