import java.lang.*;
import java.math.*;
import java.util.*;
import java.io.*;

public class Main {

    void solve() {
        int p=ni(),s=ni(),r=ni();
        precompute(100000);
        long ans=0;
        for(int i=r;i<=s;i++){
            for(int j=1;j<=p && i*1L*j<=s;j++){
                long d=mul(C[p-1][j-1],mul(inv[j],go(p-j,s-i*j,i)));
               // pw.println(C[p-1][j-1]+" "+inv[j]+" "+go(p-j,s-i*j,i));
                ans=add(ans,d);
            }
        }
        ans=mul(ans,fact[p-1]);
        ans=mul(ans,fact[s-r]);
        ans=mul(ans,modInverse(fact[s-r+p-1],M));
        pw.println(ans);





    }

    long go(int n,int m,int s){
        if(n==0) {
            if(m>0) return 0;
            else return 1;
        }
        if((s-1)*1L*n<m) return 0;

        long ans=0;
        for(int i=0;i<=n && s*1L*i<=m;i++){
            if(i%2==0)
            ans=add(ans,mul(C[n][i],C[m-s*i+n-1][n-1]));
            else ans=sub(ans,mul(C[n][i],C[m-s*i+n-1][n-1]));
        }
        return ans;
    }
    long fact[];
    int C[][];
    long inv[];
    void precompute(int n){
        C=new int[6001][6001];
        for(int i=0;i<=6000;i++) C[i][0]=1;
        for(int i=1;i<=6000;i++){
            for(int k=1;k<=i;k++) C[i][k]=(int)add(C[i-1][k-1],C[i-1][k]);
        }
        inv=new long[n+1];
        fact=new long[n+1];
        fact[0]=1;
        for(int i=1;i<=n;i++) fact[i]=mul(fact[i-1],i);
        inv[n]=modInverse(fact[n],M);
        for(int i=n-1;i>=0;i--) inv[i]=mul(inv[i+1],i+1);
        inv[1]=1;
        for(int i=2;i<=n;i++){
            inv[i]=mul(inv[i],fact[i-1]);
        }



    }


    long modpow(long a, long b)
    {
        long r=1;
        while(b>0)
        {
            if((b&1)>0) r=mul(r,a);
            a=mul(a,a);
            b>>=1;
        }
        return r;
    }
    long mul(long x,long y){
        x*=y;
        if(x>=M) x%=M;
        return x;
    }
    long add(long x,long y){
        x+=y;
        if(x>=M) x-=M;
        if(x<0) x+=M;
        return x;
    }
    long sub(long x,long y){
        x-=y;
        if(x<0) x+=M;
        return x;
    }
    long modInverse(long A, long M)
    {

        return modpow(A,M-2);
    }



    long M = 998244353;
    InputStream is;
    PrintWriter pw;
    String INPUT = "";

    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        pw = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        pw.flush();
        if (!INPUT.isEmpty()) tr(System.currentTimeMillis() - s + "ms");

    }

    public static void main(String[] args) throws Exception {
        new Main().run();
    }

    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;

    private int readByte() {
        if (lenbuf == -1) throw new InputMismatchException();
        if (ptrbuf >= lenbuf) {
            ptrbuf = 0;
            try {
                lenbuf = is.read(inbuf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (lenbuf <= 0) return -1;
        }
        return inbuf[ptrbuf++];
    }

    private boolean isSpaceChar(int c) {
        return !(c >= 33 && c <= 126);
    }

    private int skip() {
        int b;
        while ((b = readByte()) != -1 && isSpaceChar(b)) ;
        return b;
    }

    private double nd() {
        return Double.parseDouble(ns());
    }

    private char nc() {
        return (char) skip();
    }

    private String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while (p < n && !(isSpaceChar(b))) {
            buf[p++] = (char) b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }

    private char[][] nm(int n, int m) {
        char[][] map = new char[n][];
        for (int i = 0; i < n; i++) map[i] = ns(m);
        return map;
    }

    private int[] na(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = ni();
        return a;
    }

    private int ni() {
        int num = 0, b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }

        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }

        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private boolean oj = System.getProperty("ONLINE_JUDGE") != null;

    private void tr(Object... o) {
        if (INPUT.length() > 0) System.out.println(Arrays.deepToString(o));
    }

}