#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;
/////////
#pragma region Math
#pragma region
template<class T>
inline T gcd(T a, T b){return b ? gcd(b, a % b) : a;}
#pragma endregion // 最大公約数 gcd
#pragma region
template<class T>
inline T lcm(T a, T b){return a / gcd(a, b) * b;}

void solve(){
	LL N,L,H;
	cin >> N >> L >> H;
	vector<LL> A(N);
	for(int i=0;i<N;++i){
		cin >> A[i];
	}
	
	vector<LL> ans(N,0);
	for(int s=1;s<(1<<N);++s){
		LL num = 1;
		int count = 0;
		for(int i=0;i<N;++i){
			if( s & (1<<i) ){
				++count;
				num = lcm(num,A[i]);
			}
		}
		LL res = H/num;
		if( L > 1 ){
			res -= (L-1)/num;
		}
		
		for(int i=0;i<N;++i){
			if( s & (1<<i) ){
				if( count & 1 ){
					ans[i] += res;
				}else{
					ans[i] -= res;
				}
				
			}
		}
	}
	LL sumAns = 0;
	for(int i=0;i<N;++i){
		sumAns += ans[i];
	}
	cout << sumAns << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()