import numpy as np
mod=998244353
K,L,R=map(int,input().split())
s=object
A=np.zeros((K+4,K+4),dtype=s)
for i in range(K+1):
    A[i,0]=A[i,i]=1
    for j in range(1,i):A[i,j]=(A[i-1,j-1]+A[i-1,j])%mod
B=np.zeros(K+4,dtype=s)
A[K+1,K+1]=A[K+2,K+2]=A[K+3,K+1]=K;A[K+1,K]=A[K+1,K+2]=A[K+3,K+3]=A[K+3,K]=A[K+3,K+2]=B[0]=B[K+1]=B[K+2]=B[K+3]=1
def p(a,n):
    r=np.eye(K+4,dtype=s)
    while n:
        if n&1:r=(r@a)%mod
        a=(a@a)%mod;n>>=1
    return r
ans=p(A,R)
if L-1>=0:ans-=p(A,L-1)
print((ans[K+3]@B)%mod)