#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b){
	if(b==0) return a;
	return gcd(b, a%b);
}

int main()
{
	int n;
	ll l, h;
	cin>>n>>l>>h;
	ll c[10];
	for(int i=0; i<n; i++) cin>>c[i];
	int ct[1<<10];
	ct[0]=h-l+1;
	for(int i=1; i<(1<<n); i++){
		ll lcm=1;
		for(int j=0; j<n; j++){
			if(i&(1<<j)) lcm=c[j]/gcd(c[j], lcm)*lcm;
			if(lcm>h) break;
		}
		if(lcm>h){
			ct[i]=0;
		}else{
			ct[i]=h/lcm-(l-1)/lcm;
		}
	}
	ll ans=0;
	for(int i=0; i<n; i++){
		ll ans1=ct[1<<i];
		for(int j=1; j<(1<<n); j++){
			if((j&(1<<i))==0) continue;
			if(j==(1<<i)) continue;
			int d=0;
			for(int k=0; k<n; k++){
				if(j&(1<<k)) d++;
			}
			if(d%2==0) ans1-=ct[j];
			else ans1+=ct[j];
		}
		ans+=ans1;
	}
	cout<<ans<<endl;
	return 0;
}