#include "bits/stdc++.h"

using namespace std;

using ll = long long int;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { -1, 0, 1, 0 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

ll solve(ll n, ll l, ll h, vl c) {
	ll res = 0;
	for (int i = 0; i < n; i++) {
		res += h / c[i] - (l - 1) / c[i];
	}

	for (int i = 0; i < (1 << n); i++) {
		int num = i;
		int cnt = 0;
		ll d = 1;
		for (int j = 0; j < n; j++) {
			if (num % 2 == 1) {
				cnt++;
				d = lcm(d, c[j]);
			}
			num /= 2;
		}

		if (cnt <= 1) continue;
		
		if (cnt % 2 == 0) {
			res -= cnt * ((h / d) - (l - 1) / d);
		} else {
			res += cnt * ((h / d) - (l - 1) / d);
		}
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	ll n, l, h;
	cin >> n >> l >> h;

	vl c(n);
	for (int i = 0; i < n; i++) cin >> c[i];

	ll res = solve(n, l, h, c);
	cout << res << endl;
	return 0;
}