#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=998244353;
ll dp[2020][2020];
ll s[2020];
int main()
{
    int n, l, r;
    cin>>n>>l>>r;
    int a[2020];
    for(int i=1; i<=n; i++) cin>>a[i];
    for(int i=1; i<=min(r, n); i++){
        for(int j=1; j<=a[i] && j*i<=r; j++){
            dp[i*j][i]=1;
        }
    }
    ll ans=0;
    for(int i=1; i<=r; i++){
        for(int j=1; j<=min(r, n); j++){
            for(int c=1; c<=a[j] && j*c<i; c++){
                dp[i][j]+=s[i-j*c]+MOD-dp[i-j*c][j];
                dp[i][j]%=MOD;
            }
            (s[i]+=dp[i][j])%=MOD;
        }
        if(i>=l) (ans+=s[i])%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}