#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS = 1e-9;

ll N, L, H;
ll C[10];

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}

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

ll solve(ll x) {
	ll res = 0;
	FOR(i, 1, 1<<N) {
		ll now = 1;
		int cnt = 0;
		REP(j, N) if (i >> j & 1) {
			now = lcm(now, C[j]);
			cnt++;
			if (now > x) break;
		}
		if (now > x) continue;
		
		res += (x / now) * cnt * (cnt % 2 == 0 ? -1 : 1);
		
	}
	return res;
}

int main() {
	cin >> N >> L >> H;
	REP(i, N) cin >> C[i];
	
	cout << solve(H) - solve(L - 1) << endl;
	
	return 0;
}