#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
int n, S, r;
long long C[5205][5205], ans;
long long power(long long x, long long y) {
  long long ret = 1;
  for (; y; y >>= 1, x = x * x % mod)
    if (y & 1) ret = ret * x % mod;
  return ret;
}
long long inv(long long x) { return power(x, mod - 2); }
int main() {
  C[0][0] = 1;
  for (int i = 1; i <= 5200; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
  }
  scanf("%d%d%d", &n, &S, &r);
  for (int i = r; i <= S; i++)
    for (int j = 0; j < n; j++) {
      int rest = S - (j + 1) * i;
      long long tmp = 0;
      if (j + 1 == n)
        tmp = (rest == 0);
      else {
        for (int k = 0; k <= n - j - 1; k++)
          if (rest - k * i >= 0) {
            if (k & 1)
              tmp = (tmp -
                     C[n - j - 1][k] * C[rest - k * i + n - j - 2][n - j - 2] %
                         mod +
                     mod) %
                    mod;
            else
              tmp = (tmp + C[n - j - 1][k] *
                               C[rest - k * i + n - j - 2][n - j - 2] % mod) %
                    mod;
          }
      }
      ans = (ans + tmp * C[n - 1][j] % mod * inv(j + 1)) % mod;
    }
  printf("%lld\n", ans * inv(C[S - r + n - 1][n - 1]) % mod);
  return 0;
}
