#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
inline void add(int &x, int y) {
  x += y;
  if (x >= mod) x -= mod;
}
int dp[2][320][320];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n, m, x;
  cin >> n >> m >> x, --x;
  if (m < n) {
    cout << "0\n";
    return 0;
  }
  dp[0][0][0] = 1;
  for (int p = 0; p < m; ++p) {
    auto &cur = dp[p & 1];
    auto &ndp = dp[~p & 1];
    for (int i = 0; i <= n; ++i)
      for (int j = 0; j <= n; ++j) ndp[i][j] = 0;
    for (int i = 0; i <= n; ++i)
      for (int j = 0; j <= n; ++j) {
        if (p != x) add(ndp[i][j], cur[i][j]);
        add(ndp[i][j + 1], cur[i][j]);
        if (i && p != x) add(ndp[i - 1][j], cur[i][j]);
        add(ndp[i + 1][j + 1], cur[i][j]);
      }
  }
  int ans = dp[m & 1][0][n];
  for (int i = 1; i <= n; ++i) ans = (long long)ans * i % mod;
  cout << ans << "\n";
  return 0;
}
