#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
long long dp[2][400][400];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a, b = 0, c, d = 0, e, f = 0, g, h = 0, x, y, z = 0;
  cin >> a >> b >> c;
  if (a > b) {
    cout << 0 << endl;
    return 0;
  }
  dp[0][a][0] = 1;
  for (int i = b; i > c; i--) {
    f ^= 1;
    for (int j = 0; j <= a; j++) {
      for (int k = 0; k <= j; k++) {
        dp[f][j][k] = dp[f ^ 1][j][k];
        if (j < a) {
          dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j + 1][k + 1]) % 1000000007ll;
          dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j + 1][k]) % 1000000007ll;
        }
        if (k > 0) {
          dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j][k - 1]) % 1000000007ll;
        }
      }
    }
  }
  f ^= 1;
  for (int j = 0; j <= a; j++) {
    for (int k = 0; k <= j; k++) {
      dp[f][j][k] = 0;
      if (j < a) {
        dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j + 1][k + 1]) % 1000000007ll;
        dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j + 1][k]) % 1000000007ll;
      }
    }
  }
  for (int i = c - 1; i >= 1; i--) {
    f ^= 1;
    for (int j = 0; j <= a; j++) {
      for (int k = 0; k <= j; k++) {
        dp[f][j][k] = dp[f ^ 1][j][k];
        if (j < a) {
          dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j + 1][k + 1]) % 1000000007ll;
          dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j + 1][k]) % 1000000007ll;
        }
        if (k > 0) {
          dp[f][j][k] = (dp[f][j][k] + dp[f ^ 1][j][k - 1]) % 1000000007ll;
        }
      }
    }
  }
  d = 1;
  for (int i = (1); i < (a + 1); ++i) d = (d * i) % 1000000007ll;
  cout << (dp[f][0][0] * d) % 1000000007ll << endl;
}
