#include <bits/stdc++.h>
using namespace std;
long long dp[105][5005], MOD = 998244353;
int n, s, r;
long long mu(long long cs, long long sm) {
  if (sm == 0) return 1ll;
  if (sm == 1) return cs;
  long long mid = mu(cs, sm / 2);
  if (sm % 2 == 0)
    return (mid * mid) % MOD;
  else
    return (((mid * mid) % MOD) * cs) % MOD;
}
long long tohop(long long n, long long k) {
  long long tu = 1, mau = 1;
  for (int i = n - k + 1; i <= n; i++) tu = (tu * i) % MOD;
  for (int i = 1; i <= k; i++) mau = (mau * i) % MOD;
  return (tu * mu(mau, MOD - 2)) % MOD;
}
int main() {
  cin >> n >> s >> r;
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= s; j++) {
      dp[i][j] = dp[i - 1][j];
      if (j) {
        dp[i][j] = (dp[i][j] + dp[i][j - 1]) % MOD;
      }
      if (j >= r) {
        dp[i][j] = (dp[i][j] - dp[i - 1][j - r] + MOD) % MOD;
      }
    }
  }
  long long ans = mu(n, MOD - 2);
  ans = ans * (tohop(s + n - 1, n - 1) - dp[n][s] + MOD) % MOD;
  ans = ans * mu(tohop(s + n - 1 - r, n - 1), MOD - 2) % MOD;
  cout << ans;
}
