import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

n, l, r = LI()
aa = [0]+LI()

mx = 2005
dp = [[0]*(r+1) for _ in range(mx)]
cs = [0]*(r+1)
cs[0] = 1

for s in range(1, r+1):
    for i in range(1, min(s,n)+1):
        for j in range(1, aa[i]+1):
            if s-i*j < 0: break
            dp[s][i] += cs[s-i*j]-dp[s-i*j][i]
            dp[s][i] %= md
        cs[s] += dp[s][i]
        cs[s] %= md
# print(cs)

ans = 0
for i in range(l, r+1):
    ans += cs[i]
    ans %= md

print(ans)