#include <bits/stdc++.h>
using namespace std;
int fac[10010], inv[10010];
int ksm(int a, int b = 998244353 - 2) {
  int r = 1;
  for (; b; b >>= 1) {
    if (b & 1) r = 1ll * r * a % 998244353;
    a = 1ll * a * a % 998244353;
  }
  return r;
}
void init(int n = 10010 - 10) {
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % 998244353;
  inv[n] = ksm(fac[n]);
  for (int i = n - 1; i >= 0; i--)
    inv[i] = 1ll * inv[i + 1] * (i + 1) % 998244353;
}
int C(int x, int y) {
  return x < y || y < 0
             ? 0
             : 1ll * fac[x] * inv[y] % 998244353 * inv[x - y] % 998244353;
}
int B(int x, int y) { return y < 0 ? 0 : C(x + y - 1, x - 1); }
int F(int n, int m, int r) {
  if (!n && !m) return 1;
  int ans = 0, f = (n & 1) ? 998244353 - 1 : 1;
  for (int i = 0; i <= n; i++, f = 998244353 - f)
    ans = (ans +
           1ll * f * C(n, i) % 998244353 * B(n, m - (r + 1) * (n - i)) %
               998244353 +
           998244353) %
          998244353;
  return ans;
}
int main() {
  int p, s, r;
  scanf("%d%d%d", &p, &s, &r);
  init();
  int ans = 0;
  for (int i = r; i <= s; i++)
    for (int j = 0; (j + 1) * i <= s && j < p; j++)
      ans = (ans + F(p - j - 1, s - (j + 1) * i, i - 1) * 1ll * C(p - 1, j) %
                       998244353 * ksm(j + 1) % 998244353) %
            998244353;
  ans = 1ll * ans * ksm(B(p, s - r)) % 998244353;
  printf("%d\n", ans);
  return 0;
}
