#include<bits/stdc++.h>
#define ll long long
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define N 10005
#define M 998244353
#define pii pair<ll,ll>
#define int ll
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;

ll bigmod(ll a,ll n)
{
    if(n==0)
        return 1;
    ll ans=bigmod(a,n/2);
    ans=(ans*ans)%M;
    if(n%2)
        ans=(ans*a)%M;
    return ans;
}
ll f[N];
ll invf[N];
ll inv[N];

void pre()
{
    inv[1]=1;
    for(int i=2;i<N;i++)
        inv[i]=bigmod(i,M-2);
    f[0]=1;
    for(int i=1;i<N;i++)
        f[i]=f[i-1]*i%M;
    for(int i=0;i<N;i++)
        invf[i]=bigmod(f[i],M-2);
}
ll C(int n,int r)
{
    if(n<r)
        return 0;
    return f[n]*invf[n-r]%M*invf[r]%M;
}


ll get(int f,int c,int s)
{
    if(c==0)
    {
        return s==0;
    }
    ll ans=0;
    for(int i=0;i<=c;i++)
    {
        ll now=1;
        if(i%2)
        {
            now=M-1;
        }
        now=(now*C(c,i))%M;
        now=(now*C(s+c-1-i*(f+1),c-1))%M;
        ans=(ans+now)%M;
    }
    return ans;
}

main()
{
    pre();

    ll p,s,r;
    cin>>p>>s>>r;
    ll a=0,b=0;
    for(int f=r;f<=s;f++)
    {
        for(int i=1;i<=p;i++)
        {
            ll now=get(f-1,p-i,s-i*f);
            now=(now*C(p-1,i-1))%M;
            a=(a+now*inv[i])%M;
        }
        b=(b+C(s-f+p-2,p-2))%M;
    }
    a=(a*bigmod(b,M-2))%M;
    cout<<a;
}

