import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class E {
  public static int mod = 998244353;
  public static int[] fact;
    public static void main(String[] args) throws Exception {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        // Scanner scan = new Scanner(System.in);
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        // int n = Integer.parseInt(bf.readLine());
        StringTokenizer st = new StringTokenizer(bf.readLine());
        // int[] a = new int[n]; for(int i=0; i<n; i++) a[i] = Integer.parseInt(st.nextToken());
        int p = Integer.parseInt(st.nextToken());
        int s = Integer.parseInt(st.nextToken());
        int r = Integer.parseInt(st.nextToken());

        long PIE = 0; // ways of someone >= r;
        int sign = 1;
        fact = new int[6001];
        fact[0] = 1;
        for(int i=1; i<=6000; i++) {
          fact[i] = (int)(1L*fact[i-1]*i % mod);
        }
        for(int i=1; i<=p; i++) {

          if(i < p) PIE += sign*(1L*choose(p, i)*choose(s - i*r + p-i-1, p-i-1) % mod);
          else PIE += sign*1;
          PIE += mod;
          PIE %= mod;


          sign = -1*sign;
        }

        long ways_first = choose(s-r+p-2, p-2) % mod;
        long ans = frac((int)PIE, (int)((1L * ways_first * p) % mod));
        out.println(ans);

        // int n = scan.nextInt();

        out.close(); System.exit(0);
    }
    public static int exp(int base, int e) {
      if(e == 0) return 1;
      if(e == 1) return base;
      int val = exp(base, e/2);
      int ans = (int)(1L*val*val % mod);
      if(e % 2 == 1)
        ans = (int)(1L*ans*base % mod);
      return ans;
    }
    public static int inv(int base) {
      return exp(base, mod-2);
    }
    public static long frac(int p, int q) {
      return (1L*p*inv(q) % mod);
    }
    public static long choose(int a, int b) {
      if(a<b) return 0;
      if(b < 0) return 0;
      return frac(fact[a],(int)(1L*fact[b]*fact[a-b] % mod));
    }
}
