#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long gcd(long a,long b)
{
	return b?gcd(b,a%b):a;
}
long lcm(long a,long b)
{
	return a*b/gcd(a,b);
}
long n,l,h,c[10],ans;
void dfs(int i,long now,long cnt,long p,long pre)
{
	if(cnt==0)
	{
		ans+=(h/now-l/now)*pre*p;
		return;
	}
	else if(i==n)return;
	dfs(i+1,lcm(now,c[i]),cnt-1,p,pre);
	dfs(i+1,now,cnt,p,pre);
}
main()
{
	cin>>n>>l>>h;l--;
	for(int i=0;i<n;i++)cin>>c[i];
	for(int i=0;i++<n;)
	{
		dfs(0,1,i,i%2*2-1,i);
	}
	cout<<ans<<endl;
}