#include <bits/stdc++.h>
const int Mod = 998244353;
inline int qPow(int b, int e) {
  int a = 1;
  for (; e; b = (long long)b * b % Mod, e >>= 1)
    if (e & 1) a = (long long)a * b % Mod;
  return a;
}
int p, s, r, c[5505][5505];
void Init() {
  for (int i = 0; i <= 5500; ++i) c[i][0] = 1;
  for (int i = 0; i <= 5500; ++i)
    for (int j = 1; j <= i; ++j)
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % Mod;
}
int f[105][5005];
int Sum1, Sum2;
int main() {
  Init();
  scanf("%d%d%d", &p, &s, &r);
  if (p == 1) return puts("1"), 0;
  for (int x = r; x <= s; ++x) {
    if (x * p < s) continue;
    f[0][0] = 1;
    for (int i = 1; i <= p; ++i) {
      for (int j = 0; j <= s; ++j) {
        if (j == 0)
          f[i][j] = 1;
        else if (j < x)
          f[i][j] = (f[i][j - 1] + f[i - 1][j]) % Mod;
        else
          f[i][j] =
              ((long long)f[i][j - 1] + f[i - 1][j] - f[i - 1][j - x] + Mod) %
              Mod;
      }
    }
    Sum1 = (Sum1 + c[s - x + p - 2][p - 2]) % Mod;
    for (int i = 1; i <= s; ++i) {
      if (i * x > s || (p - i) * (x - 1) + i * x < s) continue;
      Sum2 = (Sum2 + (long long)c[p - 1][i - 1] * f[p - i][s - i * x] % Mod *
                         qPow(i, Mod - 2)) %
             Mod;
    }
  }
  printf("%lld\n", (long long)Sum2 * qPow(Sum1, Mod - 2) % Mod);
  return 0;
}
