#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void ckmax(T& x, T y) {
  x = (y > x ? y : x);
}
template <typename T>
inline void ckmin(T& x, T y) {
  x = (y < x ? y : x);
}
const int MAXN = 100, MAXM = 5000;
const int MOD = 998244353;
inline int mod1(int x) { return x < MOD ? x : x - MOD; }
inline int mod2(int x) { return x < 0 ? x + MOD : x; }
inline void add(int& x, int y) { x = mod1(x + y); }
inline void sub(int& x, int y) { x = mod2(x - y); }
inline int pow_mod(int x, int i) {
  int y = 1;
  while (i) {
    if (i & 1) y = (long long)y * x % MOD;
    x = (long long)x * x % MOD;
    i >>= 1;
  }
  return y;
}
int fac[MAXM + 5], ifac[MAXM + 5];
inline int comb(int n, int k) {
  if (n < k) return 0;
  return (long long)fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
}
void facinit(int lim) {
  fac[0] = 1;
  for (int i = 1; i <= lim; ++i) fac[i] = (long long)fac[i - 1] * i % MOD;
  ifac[lim] = pow_mod(fac[lim], MOD - 2);
  for (int i = lim - 1; i >= 0; --i)
    ifac[i] = (long long)ifac[i + 1] * (i + 1) % MOD;
}
int n, m, low;
int main() {
  facinit(MAXM);
  cin >> n >> m >> low;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  int ans = 0;
  for (int v = low; v <= m; ++v) {
    for (int i = 1; i < n; ++i) {
      if (i * v > m) break;
      int curans = 0;
      for (int j = 0; j <= n - i; ++j) {
        if ((i + j) * v > m) break;
        int tmp = (long long)comb(n - 1, i - 1) * comb(n - i, j) % MOD *
                  comb(m - (i + j) * v + (n - i) - 1, n - i - 1) % MOD;
        if (j & 1)
          sub(curans, tmp);
        else
          add(curans, tmp);
      }
      add(ans, (long long)curans * ifac[i] % MOD * fac[i - 1] % MOD);
    }
    if (n * v == m) {
      add(ans, (long long)ifac[n] * fac[n - 1] % MOD);
    }
  }
  ans = (long long)ans * pow_mod(comb(m - low + n - 1, n - 1), MOD - 2) % MOD;
  cout << ans << endl;
  return 0;
}
