#include <bits/stdc++.h>
const long long mod = 998244353;
long long f[5005], invf[5005];
long long dp[105][5005];
long long prefix[5005];
long long power(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b % 2) res = res * a % mod;
    a = a * a % mod;
    b /= 2;
  }
  return res;
}
long long inv(long long u) { return power(u, mod - 2); }
void preWork(int n) {
  f[0] = invf[0] = 1;
  for (int i = 1; i <= n; i++) {
    f[i] = f[i - 1] * (long long)i % mod;
    invf[i] = inv(f[i]);
  }
}
long long comb(int n, int m) {
  if (m > n || m < 0)
    return 0;
  else
    return f[n] * invf[m] % mod * invf[n - m] % mod;
}
long long solve(int n, int r, int s) {
  dp[0][0] = 1;
  prefix[0] = 1;
  for (int i = 1; i <= s; i++) prefix[i] = prefix[i - 1];
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= s; j++) {
      dp[i][j] = prefix[j];
      int last = j - r;
      if (last >= 0) dp[i][j] -= prefix[last];
      if (dp[i][j] < 0) dp[i][j] += mod;
    }
    prefix[0] = dp[i][0];
    for (int j = 1; j <= s; j++) {
      prefix[j] = prefix[j - 1] + dp[i][j];
      if (prefix[j] >= mod) prefix[j] -= mod;
    }
  }
  long long res = 0;
  for (int i = 1; i <= n && i * r <= s; i++) {
    long long add = comb(n - 1, i - 1) * dp[n - i][s - i * r] % mod;
    add = add * inv(i) % mod;
    res += add;
    if (res >= mod) res -= mod;
  }
  return res;
}
int main() {
  int p, r, s;
  scanf("%d%d%d", &p, &s, &r);
  preWork(s);
  for (int i = 0; i <= s; i++) dp[1][i] = 0;
  for (int i = r; i <= s; i++) dp[1][i] = 1;
  prefix[0] = dp[1][0];
  for (int i = 1; i <= s; i++) prefix[i] = prefix[i - 1] + dp[1][i];
  for (int i = 2; i <= p; i++) {
    for (int j = 0; j <= s; j++) {
      dp[i][j] = prefix[j];
    }
    prefix[0] = dp[i][0];
    for (int j = 1; j <= s; j++) {
      prefix[j] = prefix[j - 1] + dp[i][j];
      if (prefix[j] >= mod) prefix[j] -= mod;
    }
  }
  long long all = dp[p][s];
  long long good = 0;
  for (int i = r; i <= s; i++) {
    good += solve(p, i, s);
    if (good >= mod) good -= mod;
  }
  printf("%lld\n", good * inv(all) % mod);
  return 0;
}
