const int MAXN=15,MAXV=5e5+5;
const LL inf=1e18;
int a[MAXN];
LL dis[MAXV];
bool vis[MAXV];
void dj(int n){
	priority_queue<pair<LL,int> >q;
	q.push(make_pair(0,0));
	_for(i,1,a[0])
	dis[i]=inf;
	while(!q.empty()){
		int u=q.top().second;q.pop();
		if(vis[u])
		continue;
		vis[u]=true;
		_for(i,1,n){
			int v=(u+a[i])%a[0],w=a[i];
			if(dis[v]>dis[u]+w){
				dis[v]=dis[u]+w;
				q.push(make_pair(-dis[v],v));
			}
		}
	}
}
LL calc(LL val){
	LL ans=0;
	_for(i,0,a[0]){
		if(dis[i]<=val)
		ans+=(val-dis[i])/a[0]+1;
	}
	return ans;
}
int main(){
	int n=read_int();
	LL ql=read_LL(),qr=read_LL();
	_for(i,0,n)
	a[i]=read_int();
	sort(a,a+n);
	dj(n);
	enter(calc(qr)-calc(ql-1));
	return 0;
}