n,l,u = map(int,input().split())
mod = 998244353; fa = [1]*(2*n+u+1); fi = [1]*(2*n+u+1)
for i in range(1,2*n+u): fa[i+1] = fa[i]*(i+1)%mod
fi[2*n+u] = pow(fa[2*n+u],mod-2,mod)
for i in range(2*n+u,0,-1): fi[i-1] = fi[i]*i%mod
def cmb(n,r): return fa[n]*fi[r]%mod*fi[n-r]%mod if 0<=r<=n else 0
ans = 0
for i in range(n+l,n+u+1): ans = (ans+cmb(n-1+i,i)-cmb(n-1+i,i-u-2))%mod
print(ans)