#include <bits/stdc++.h>
using namespace std;
long long n, sum, mn, ans, p = 998244353, c[5111][5111];
long long ksm(long long x, long long y) {
  long long xlh = 1;
  while (y) {
    if (y & 1) xlh = xlh * x % p;
    x = x * x % p;
    y /= 2;
  }
  return xlh;
}
void solve(long long x, long long sy) {
  long long i, j, xlh, fa, zo = 0, now, hh, ha;
  for (i = 0; i <= n; i++) {
    if (x * i > sy) break;
    hh = sy - x * i;
    now = c[n][i];
    ha = n - i;
    fa = 0;
    for (j = 0; j <= ha; j++) {
      if (j * x > hh) break;
      if (hh - j * x + ha - 1 < 0)
        xlh = 1;
      else
        xlh = c[ha][j] * c[hh - j * x + ha - 1][ha - 1] % p;
      if (j % 2 == 0)
        fa = (fa + xlh) % p;
      else
        fa = (fa - xlh + p) % p;
    }
    zo = (zo + now * fa % p * ksm(i + 1, p - 2) % p) % p;
  }
  ans = (ans + zo) % p;
}
int main() {
  long long i, j;
  for (i = 0; i <= 5110; i++) c[i][0] = 1;
  for (i = 1; i <= 5110; i++)
    for (j = 1; j <= i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % p;
  scanf("%lld%lld%lld", &n, &sum, &mn);
  n--;
  for (i = mn; i <= sum; i++) {
    solve(i, sum - i);
  }
  n++;
  printf("%lld", ans * ksm(c[sum - mn + n - 1][n - 1], p - 2) % p);
}
