#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MAX=1e5+5;
ll MOD=998244353;
#define pb push_back
#define se second
#define fi first
#define maxe max_element
#define mine min_element
#define debug(x) cout<<#x<<" :: "<<x<<endl;
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<endl;
#define debug3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<endl;
#define debug4(x,y,z,w) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\t"<<#w<<" :: "<<w<<endl;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fbo find_by_order
#define ook order_of_key
#define up upper_bound
#define lb lower_bound
#define pq priority_queue
#define pll pair<ll,ll>
#define boost               ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define dt pair<pll,ll>
ll x,y,inv[MAX],fact[MAX];
void divmod(ll a,ll b)
{
	if(!(a%b)){x=0,y=1;return ;}
	divmod(b,a%b);
	ll temp=x;
	x=y;
	y=temp-(a/b)*y;
}
void pre()
{
	fact[0]=1;
	for(ll i=1;i<MAX;i++)fact[i]=(fact[i-1]*i)%MOD;
	for(ll i=0;i<MAX;i++){
		divmod(fact[i],MOD);
		inv[i]=(x+MOD)%MOD;
	}
}	
ll comb(ll n,ll r)
{
	if(n==r)return 1;
	if(n<0 || r<0 || n<r)return 0;
	ll ans=(fact[n]*inv[r])%MOD;
	ans=(ans*inv[n-r])%MOD;
	return ans;
}
ll invcomb(ll n,ll r)
{
	ll ans=(inv[n]*fact[r])%MOD;
	ans=(ans*fact[n-r])%MOD;
	return ans;
}
int main()
{
	boost;
	pre();
	ll p,r,s;
	cin>>p>>s>>r;
	ll ans=0;
	for(ll i=r;i<=s;i++){
		for(ll j=1;j<=p;j++){
			ll t=s-j*i;
			ll ans1=0;
			for(ll q=0;q<=p-j;q++){
				if(q%2)ans1=(ans1-((comb(p-j,q)*comb(p-j+s-j*i-i*q-1,p-j-1))%MOD)+MOD)%MOD;
				else ans1=(ans1+(comb(p-j,q)*comb(p-j+s-j*i-i*q-1,p-j-1))%MOD)%MOD;
				//debug4(i,p-j+s-j*i-i*q-1,p-j-1,comb(p-j+s-j*i-i*q-1,p-j-1));
			}
			ans1=(ans1*inv[j])%MOD;
			ans1=(ans1*comb(p-1,j-1))%MOD;
			ans=(ans+ans1)%MOD;
			//debug2(comb(p-1,j-1),inv[j]);
		}
	}
	ans=(ans*invcomb(s-r+p-1,p-1))%MOD;
	cout<<ans;
	
}
		
	
				