#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void chkmin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline void chkmax(T &a, T b) {
  if (a < b) a = b;
}
inline int read() {
  int s = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch) && ch != '-') ch = getchar();
  if (ch == '-') ch = getchar(), f = -1;
  while (isdigit(ch)) s = s * 10 + ch - '0', ch = getchar();
  return ~f ? s : -s;
}
const int mod = 998244353;
int inv[50020], jc[50020], jcn[50020];
inline int power(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (long long)ans * a % mod;
    b >>= 1;
    a = (long long)a * a % mod;
  }
  return ans;
}
inline int C(int n, int m) {
  if (n < 0 || n < m) return 0;
  return 1ll * jc[n] * jcn[m] % mod * jcn[n - m] % mod;
}
int n, m, r;
inline void init() {
  jc[0] = jc[1] = jcn[0] = jcn[1] = inv[1] = 1;
  for (int i = (2), _end_ = (5e4); i <= _end_; i++)
    inv[i] = (long long)(mod - mod / i) * inv[mod % i] % mod,
    jc[i] = (long long)jc[i - 1] * i % mod,
    jcn[i] = (long long)jcn[i - 1] * inv[i] % mod;
  n = read();
  m = read();
  r = read();
}
inline void doing() {
  int ans = 0, fas = 0;
  fas = C(m - r + n - 1, n - 1);
  for (int x = (r), _end_ = (m); x <= _end_; x++) {
    for (int num = (1), _end_ = (n); num <= _end_; num++)
      if (num * x <= m) {
        int rest = m - num * x, renum = n - num,
            xs = (long long)inv[num] * C(n - 1, num - 1) % mod;
        if (renum == 0) {
          if (rest == 0) ans = (ans + xs) % mod;
        } else {
          for (int j = (0), _end_ = (n - num); j <= _end_; j++) {
            int re = rest - j * x;
            if (re >= 0)
              ans = (ans + (j & 1 ? -1 : 1) *
                               (long long)C(re + renum - 1, renum - 1) * xs %
                               mod * C(renum, j)) %
                    mod;
          }
        }
      }
  }
  ans = (ans + mod) % mod;
  ans = (long long)ans * power(fas, mod - 2) % mod;
  printf("%d\n", ans);
}
int main() {
  init();
  doing();
  return 0;
}
