#include <bits/stdc++.h>
using namespace std;

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

ll N,L,H;
const ll MAX_N = 10;
vector<ll> A;
ll cnt [1 << MAX_N];

ll gcd(ll x,ll y)
{
	return y ? gcd(y,x % y) : x;
}

ll lcm(ll x,ll y)
{
	return x / gcd(x,y) * y;
}

ll bit_count(ll x)
{
	ll res = 0;
	for(;x;x -= x & -x) res++;
	return res;
}

int main()
{
	scanf("%lld%lld%lld",&N,&L,&H);
	A.assign(N,0);
	FOR(i,0,N){
		scanf("%lld",&A [i]);
	}

	ll ans = 0;
	FOR(i,0,N){
		int mask = 1 << i;
		ans += H / A [i] - (L - 1) / A [i];
		FOR(mask2,0,1 << N) if((mask & mask2) == mask){
			cnt [mask2]++;
		}
	}

	FOR(mask,1,1 << N) if(bit_count(mask) > 1){
		ll l = 1;
		FOR(i,0,N) if(mask >> i & 1){
			l = lcm(l,A [i]);
		}
		ll x = H / l - (L - 1) / l;
		ll y = cnt [mask];
		ans += x * -y;
		FOR(mask2,0,1 << N) if((mask & mask2) == mask){
			cnt [mask2] -= y;
		}
	}

	printf("%lld\n",ans);

	return 0;
}