/*
??????
??????
??????
??????
D P ????
??????
??????
??????
??????
??? l l?
??????
??????
?? OI ??
??????
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
//#define eps 1e-9
//#define ENF 1e13
const int N=1e2;
const int mod=1e9+7;
inline int read()
{
   int x=0,f=1;char ch=getchar();
   while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
   while (ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-48;ch=getchar();}
   return x*f;
}
void write(int x)
{
   if(x<0)putchar('-'),x=-x;
   if(x<10)putchar(x+'0');
   else write(x/10),putchar(x%10+'0');
}
int n,l,r;
int C[N];
int sum;
vector<int>g;
int lcm(int a,int b){
	return a*b/__gcd(a,b);
}
void cal(){
	int lm=g[0];
	for(int i=0;i<g.size();i++)lm=lcm(lm,g[i]);
	sum+=r/lm-l/lm;
	return;
}
void dfs(int u,int sm){
	if(u==n+1||g.size()==sm){	
		if(g.size()!=sm)return;
		cal();
		return;
	}
	g.push_back(C[u]);
	dfs(u+1,sm);
	g.pop_back();
	dfs(u+1,sm);
	return;
}
int ans;
signed main(){
//	freopen("onlyone.in","r",stdin);
//	freopen("onlyone.out","w",stdout);
	n=read(),l=read(),r=read();
	l--;
	if(n==1){
		int c=read();
		cout<<r/c-l/c<<"\n";
		return 0;
	}
	if(l==r){
		bool fl=0;
		bool fg=0;
		for(int i=1;i<=n;i++){
			int c=read();
			if(l%c==0){
				if(fl){
					fg=1;	
				}
				fl=1;
			}
		}
		if(fg==1||fl==0)cout<<0<<"\n";
		else cout<<1<<"\n";
		return 0;
	}
	for(int i=1;i<=n;i++)C[i]=read();
	for(int i=1;i<=n;i++){
		int fl=-1;
		if(i&1)fl=1;
		dfs(1,i);
//		cout<<sum<<" "<<fl<<"\n";
		ans+=fl*sum*i;
		sum=0;
		g.clear();
	}
	cout<<ans<<"\n";
   return 0;
}
// ?????????????AC????
// ?????????????????????????
// ??????????????????
// ????????????????????????????????????
// ???????????????????????????????
// ????????????
// ????????????
// ????????????
// ????????????????????
// ????????????????????
// ????????????????????????????????
// ???????????????????????
// ???????????
// ?????????????