## https://yukicoder.me/problems/no/1353

MOD = 998244353


def main():
    N, L, R = map(int, input().split())
    A = list(map(int, input().split()))

    answer = 0
    dp = [[0] * (N + 1) for _ in range(R + 1)]
    dp[0][0] = 1
    cum_dp = [0 for _ in range(R + 1)]
    cum_dp[0] = 1


    cum_dp_table = [[0 for _ in range(max(1, n))] for n in range(N + 1)]
    cum_dp_cnt = [[0 for _ in range(max(1, n))] for n in range(N + 1)]
    for n in range(1, N + 1):
        cum_dp_table[n][0] += dp[0][0]
        cum_dp_table[n][0] %= MOD
        cum_dp_cnt[n][0] += 1


    for r in range(1, R + 1):
        for n in range(1, N + 1):
            dp[r][n] += cum_dp_table[n][r % n]
            dp[r][n] %= MOD

        for n in range(1, N + 1):
            cum_dp[r] += dp[r][n]
            cum_dp[r] %= MOD

        for n in range(1, N + 1):
            y = (cum_dp[r] - dp[r][n]) % MOD
            cum_dp_table[n][r % n] += y
            cum_dp_table[n][r % n] %= MOD
            cum_dp_cnt[n][r % n] += 1
            if cum_dp_cnt[n][r % n] > A[n - 1]:
                y = (cum_dp[r - A[n - 1] * n] - dp[r - A[n - 1] * n][n]) % MOD
                cum_dp_table[n][r % n] -= y % MOD
                cum_dp_table[n][r % n] %= MOD
                cum_dp_cnt[n][r % n] -= 1




    answer = 0
    for r in range(L, R + 1):
        for l in range(1, N + 1):
            answer += dp[r][l]
            answer %= MOD

    print(answer)



if __name__ == "__main__":
    main()