#include<bits/stdc++.h>
#define int long long
#define lowbit(x) x&(-x)
using namespace std;
const int mod=998244353;
int n,l,u,jie[300005],inv[300005],ans=0;
int qpow(int a,int b=mod-2){
    int ans=1;
    while(b){
        if(b&1)ans=ans*a%mod;
        a=a*a%mod,b>>=1;
    }
    return ans;
}
int C(int n,int m){if(n<m||n<0||m<0)return 0;return jie[n]*inv[m]%mod*inv[n-m]%mod;}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n>>l>>u,jie[0]=inv[0]=1;
    for(int i=1;i<=300000;i++)jie[i]=jie[i-1]*i%mod;inv[300000]=qpow(jie[300000]);
    for(int i=299999;i;i--)inv[i]=inv[i+1]*(i+1)%mod;
    for(int i=n+l;i<=n+u;i++)(ans+=C(n+i-1,n-1)-C(n+i-1,n+u+1)+mod)%=mod;
    cout<<ans;
    return 0;
}