#include<cstdio>
#include<vector>
#include<algorithm>


using namespace std;
using vi=vector<int>;
using ll=long long;


ll gcd(ll a, ll b)
{
	ll c;

	while((c=a%b))
	{
		a=b;
		b=c;
	}
	return b;
}


ll lcm(ll a, ll b)
{
	return a/gcd(a,b)*b;
}


int main(void)
{
	int n, l, h;

	while(scanf("%d%d%d", &n, &l, &h)==3)
	{
		l--;
		vi c(n);
		for(int i=0;i<n;i++) scanf("%d", &c[i]);

		int ans=0;
		sort(c.begin(), c.end(), greater<int>());
		for(int i=1;i<=n;i++)
		{
			vi f(n);
			for(int j=0;j<i;j++)
			{
				f[j]=1;
			}

			do
			{
				ll t=1;
				for(int j=0;j<n;j++)
				{
					if(f[j]) t=lcm(t, c[j]);
					if(t>h) break;
				}
				if(t<=h)
				{
					if(i&1) ans+=(h/t-l/t)*i;
					else ans-=(h/t-l/t)*i;
				}
//for(auto fe:f) printf("%d ", fe);
//printf("\n");

			}
			while(prev_permutation(f.begin(), f.end()));
//printf("i=%d  ans=%d\n", i, ans);
		}
		printf("%d\n", ans);
	}
	return 0;
}