#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#define REP(i, n) for(long long i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
#define INF (long long)1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

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

int solve(int* c, int m, int n) {
	int res = 0;
	for(int i = 1; i < (1 << m); i++) {
		int num = 0;
		for(int j = i; j != 0; j >>= 1) num += j & 1;
		int lcm = 1;
		for(int j = 0; j < m; ++j) {
			if((i >> j) & 1) {
				lcm = lcm / gcd(lcm, c[j]) * c[j];
				if(lcm > n) break;
			}
		}
		if(num % 2 == 0) res -= n / lcm;
		else res += n / lcm;
	}
	return res;
}

int main() {
	int n, l, h;
	cin>>n>>l>>h;
	int c[n];
	REP(i, n) cin>>c[i];
	int res = 0;
	int a = solve(c, n, h);
	int z = 0;
	if(l > 1) z = solve(c, n, l - 1);
	REP(i, n) {
		vector<int> buf;
		REP(j, n) {
			if(j == i) continue;
			else buf.push_back(c[j]);
		}
		int b[n - 1];
		REP(j, n - 1) b[j] = buf[j];
		res += a - solve(b, n - 1, h);
		if(l > 1) res -= z - solve(b, n - 1, l - 1);
	}
	cout<<res<<endl;
}