#include <bits/stdc++.h>
inline int gi() {
  int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
inline int pow(int x, int y) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = 1ll * ret * x % 998244353;
    x = 1ll * x * x % 998244353;
    y >>= 1;
  }
  return ret;
}
int CC[5110][5110];
inline int C(int n, int m) {
  if (n < m || n < 0 || m < 0) return 0;
  return CC[n][m];
}
inline int solve(int n, int m, int lim) {
  if (n == 0) return 1;
  if (n < 0) return 0;
  int ans = 0;
  for (int i = 0; i <= m; ++i)
    ans = (ans + 1ll * ((i & 1) ? 998244352 : 1) * C(m, i) % 998244353 *
                     C(n - lim * i + m - 1, m - 1)) %
          998244353;
  return ans;
}
int inv[101];
int main() {
  CC[0][0] = 1;
  for (int i = 1; i <= 5109; ++i) {
    CC[i][0] = 1;
    for (int j = 1; j <= i; ++j)
      CC[i][j] = (CC[i - 1][j] + CC[i - 1][j - 1]) % 998244353;
  }
  int p = gi(), s = gi(), r = gi();
  int ans = 0;
  inv[1] = 1;
  for (int i = 2; i <= p; ++i)
    inv[i] = 998244353 - 1ll * (998244353 / i) * inv[998244353 % i] % 998244353;
  for (int x = r; x <= s; ++x)
    for (int i = 1; i <= p; ++i) {
      if ((p - i) * (x - 1) + i * x < s) continue;
      ans = (ans + 1ll * C(p - 1, i - 1) * solve(s - i * x, p - i, x) %
                       998244353 * inv[i]) %
            998244353;
    }
  printf("%d\n",
         1ll * ans * pow(C(s - r + p - 1, p - 1), 998244353 - 2) % 998244353);
  return 0;
}
