#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
template <class T>
void dbs(string str, T t) {
  cout << str << " : " << t << endl;
}
template <class T, class... second>
void dbs(string str, T t, second... s) {
  int idx = str.find(',');
  cout << str.substr(0, idx) << " : " << t << ",";
  dbs(str.substr(idx + 1), s...);
}
template <class second, class T>
ostream& operator<<(ostream& os, const pair<second, T>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class second, class T>
ostream& operator<<(ostream& os, const map<second, T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
void prc(T a, T b) {
  cout << "[";
  for (T i = a; i != b; ++i) {
    if (i != a) cout << ", ";
    cout << *i;
  }
  cout << "]";
  cout << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, x;
  cin >> n >> m >> x;
  if (n > m) return cout << 0, 0;
  vector<vector<vector<int>>> dp(
      2, vector<vector<int>>(n + 1, vector<int>(n + 1, 0)));
  dp[1][0][0] = 1;
  int now = 0, prv = 1;
  for (auto i = (m); i >= (1); --i) {
    for (auto j = (0); j <= (n); ++j)
      for (auto k = (0); k <= (n); ++k) dp[now][j][k] = 0;
    for (auto j = (0); j <= (n); ++j) {
      for (auto k = (0); k <= (n); ++k) {
        if (i != x) dp[now][j][k] = dp[prv][j][k];
        if (j != n and k) dp[now][j][k] += dp[prv][j + 1][k - 1];
        if (dp[now][j][k] >= inf) dp[now][j][k] -= inf;
        if (j) {
          if (i != x) {
            dp[now][j][k] += dp[prv][j - 1][k];
            if (dp[now][j][k] >= inf) dp[now][j][k] -= inf;
          }
        }
        if (k) {
          dp[now][j][k] += dp[prv][j][k - 1];
          if (dp[now][j][k] >= inf) dp[now][j][k] -= inf;
        }
      }
    }
    swap(now, prv);
  }
  int ans = dp[prv][0][n];
  for (auto i = (1); i <= (n); ++i) ans = (ans * 1LL * i) % inf;
  cout << ans << "\n";
  return 0;
}
