//@formatter:off #include #define overload4(_1,_2,_3,_4,name,...) name #define rep1(i,n) for (ll i = 0; i < ll(n); ++i) #define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i) #define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d) #define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__) #define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define pb push_back #define eb emplace_back #define vi vector #define vvi vector> #define vl vector #define vvl vector> #define vd vector #define vvd vector> #define vs vector #define vc vector #define vvc vector> #define vb vector #define vvb vector> #define vp vector

#define vvp vector> #ifdef __LOCAL #define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; } #else #define debug(...) void(0) #endif #define INT(...) int __VA_ARGS__;scan(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__) #define STR(...) string __VA_ARGS__;scan(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__) using namespace std; using ll = long long; using P = pair; using LP = pair; template istream& operator>>(istream &is,pair &p) { return is >> p.first >> p.second; } template ostream& operator<<(ostream &os,const pair &p) { return os<<'{'< istream& operator>>(istream &is,vector &v) { for(T &t:v){is>>t;} return is; } template ostream& operator<<(ostream &os,const vector &v) { os<<'[';rep(i,v.size())os< void fin(T a) { cout << a << '\n'; exit(0); } template bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;} template bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;} void scan(){} template void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); } template void print(const T& t){ cout << t << '\n'; } template void print(const Head& head, const Tail&... tail){ cout<= mod) x -= mod; return *this; } constexpr mint &operator++() { return *this += mint(1); } constexpr mint &operator-=(const mint &a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; } constexpr mint &operator--() { return *this -= mint(1); } constexpr mint &operator*=(const mint &a) { (x *= a.x) %= mod; return *this; } constexpr mint operator+(const mint &a) const { mint res(*this); return res += a; } constexpr mint operator-(const mint &a) const { mint res(*this); return res -= a; } constexpr mint operator*(const mint &a) const { mint res(*this); return res *= a; } constexpr mint pow(ll t) const { mint res = mint(1), a(*this); while (t > 0) { if (t & 1) res *= a; t >>= 1; a *= a; } return res; } // for prime mod constexpr mint inv() const { return pow(mod - 2); } constexpr mint &operator/=(const mint &a) { return *this *= a.inv(); } constexpr mint operator/(const mint &a) const { mint res(*this); return res /= a; } }; ostream &operator<<(ostream &os, const mint &a) { return os << a.x; } bool operator==(const mint &a, const mint &b) { return a.x == b.x; } bool operator!=(const mint &a, const mint &b) { return a.x != b.x; } bool operator==(const mint &a, const int &b) { return a.x == b; } bool operator!=(const mint &a, const int &b) { return a.x != b; } mint dp[2010][2010]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); INT(n, l, r); vi a(n); cin >> a; rep(i, n) { rep(j, 1, a[i] + 1) { if ((i + 1) * j > r) break; dp[(i + 1) * j][i] += 1; } } rep(i, 1, r) { vector ls(n + 1), rs(n + 1); rep(j, n) ls[j + 1] = ls[j] + dp[i][j]; rrep(j, n) rs[j] = rs[j + 1] + dp[i][j]; rep(j, n) { rep(k, 1, a[j] + 1) { int now = (j + 1) * k; if (i + now > r) break; dp[i + now][j] += ls[j] + rs[j + 1]; } } } mint ans = 0; rep(i, l, r + 1) rep(j, n) ans += dp[i][j]; print(ans); }