#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for (int i = a; i < b; i++)
#define trav(a,b) for (auto a : b)
#define lld long long
using i64 = long long;
#define all(x) begin(x),end(x)
#define sz(a) (int)a.size()
const lld MOD=998244353;
const long double PI = acos(-1.0L);
void fft(vector<complex<double>> &a) {
	int n = sz(a), L = 31-__builtin_clz(n);
	static vector<complex<long double>> R(2, 1);
	static vector<complex<double>> rt(2, 1);
	for (static int k=2; k<n; k*=2) {
		R.resize(n); rt.resize(n);
		auto x = polar(1.0L, PI/k);
		for (int i=k; i<2*k; i++) rt[i] = R[i] = i&1 ? R[i/2]*x : R[i/2];
	}
	vector<int> rev(n);
	for (int i=0; i<n; i++) rev[i] = (rev[i/2] | (i&1)<<L)/2;
	for (int i=0; i<n; i++) if (i<rev[i]) swap(a[i], a[rev[i]]);
	for (int k=1; k<n; k*=2) {
		for (int i=0; i<n; i+=2*k) {
			for (int j=0; j<k; j++) {
				auto x = (double*) &rt[j+k], y = (double*) &a[i+j+k];
				complex<double> z(x[0]*y[0] - x[1]*y[1], x[0]*y[1] + x[1]*y[0]);
				a[i+j+k] = a[i+j] - z;
				a[i+j] += z;
			}
		}
	}
}
vector<i64> convolution_mod(const vector<i64> &a, const vector<i64> &b, i64 mod) {
	if (a.empty() || b.empty()) return {};
	vector<i64> res(sz(a)+sz(b)-1);
	int B = 32-__builtin_clz(sz(res)), n = 1<<B;
	i64 cut = sqrt(mod);
	vector<complex<double>> L(n), R(n), outs(n), outl(n);
	for (int i=0; i<sz(a); i++) L[i] = complex<double>((i64)a[i]/cut, (i64)a[i]%cut);
	for (int i=0; i<sz(b); i++) R[i] = complex<double>((i64)b[i]/cut, (i64)b[i]%cut);
	fft(L), fft(R);
	for (int i=0; i<n; i++) {
		int j = -i&(n-1);
		outl[j] = (L[i] + conj(L[j])) * R[i] / (2.0*n);
		outs[j] = (L[i] - conj(L[j])) * R[i] / (2.0*n) / 1i;
	}
	fft(outl), fft(outs);
	for (int i=0; i<sz(res); i++) {
		i64 av = i64(real(outl[i])+0.5), cv = i64(imag(outs[i])+0.5);
		i64 bv = i64(imag(outl[i])+0.5) + i64(real(outs[i])+0.5);
		res[i] = ((av % mod * cut + bv) % mod * cut + cv) % mod;
		if(res[i]>0)res[i]=1;
		else res[i]=0;
	}
	return res;
}
vector<lld> pot1[11];
vector<lld> pot2[11];
void solve() {
	int n;
	cin>>n;
	int l,r;
	cin>>l>>r;
	vector<int> arr(n);
	rep(i,0,n)cin>>arr[i];
	int mx=arr[n-1];
	pot1[0].resize(mx+1,0);
	pot2[0].resize(mx+1,0);
	rep(i,0,n)pot1[0][arr[i]]=1,pot2[0][arr[i]]=1;
	pot2[0][0]=1;
	rep(i,1,11){
		pot1[i]=convolution_mod(pot1[i-1],pot1[i-1],MOD);
		pot2[i]=convolution_mod(pot2[i-1],pot2[i-1],MOD);
	}
	vector<lld> ans;
	ans.push_back(1);
	int diff=r-l;
	for(int pt=0;pt<11;pt++){
		if(((1<<pt)&l)>0){
			ans=convolution_mod(ans,pot1[pt],MOD);
		}
	}
	for(int pt=0;pt<11;pt++){
		if(((1<<pt)&diff)>0){
			ans=convolution_mod(ans,pot2[pt],MOD);
		}
	}
	int sum=0;
	trav(a,ans)sum+=a;
	//~ trav(a,ans)cout<<a;
	//~ cout<<endl;
	cout<<sum<<"\n";
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt = 1;
	//~ cin >> tt;
	while (tt--) solve();
	return 0;
}