#include <bits/stdc++.h>
using namespace std;
long long dp[2][411][411];
int main() {
  int n, m, x;
  scanf("%d%d%d", &n, &m, &x);
  if (n > m) {
    printf("0\n");
    return 0;
  }
  dp[0][0][0] = 1;
  for (int i = 0; i < m; i++) {
    int prev = i & 1;
    int cur = 1 - prev;
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= j; k++) dp[cur][j][k] = 0;
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= j; k++) {
        if (dp[prev][j][k]) {
          if (i + 1 != x) {
            dp[cur][j][k] =
                (dp[cur][j][k] + dp[prev][j][k]) % (1000 * 1000 * 1000 + 7);
            if (k > 0)
              dp[cur][j][k - 1] = (dp[cur][j][k - 1] + dp[prev][j][k]) %
                                  (1000 * 1000 * 1000 + 7);
          }
          if (j + 1 <= n) {
            dp[cur][j + 1][k + 1] = (dp[cur][j + 1][k + 1] + dp[prev][j][k]) %
                                    (1000 * 1000 * 1000 + 7);
            dp[cur][j + 1][k] =
                (dp[cur][j + 1][k] + dp[prev][j][k]) % (1000 * 1000 * 1000 + 7);
          }
        }
      }
    }
  }
  long long ans = dp[m & 1][n][0];
  for (int i = 1; i <= n; i++) ans = (ans * 1LL * i) % (1000 * 1000 * 1000 + 7);
  printf("%lld\n", ans);
  return 0;
}
