#include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
#include <cstdio>
#include <chrono>
#include <unordered_map>



using namespace std;

typedef long long int ll;

#define REP(i,n) for(int i=0; i<(n); ++i )
#define REPR(i,n) for(int i=(n); i>=0; --i)
#define FOR(i,a,n) for(int i=(a); i<(n); ++i )
#define FORR(i,a,n) for(int i=(n); i>=(a); --i)

#define DOUT(x) cerr << #x << " = " << (x) << "\n";
#define COUT(x) cout << (x) << "\n";

signed main()
{
	ll n, l, h;
	cin >> n >> l >> h;
	unordered_map<ll, ll> a;
	unordered_map<ll, ll> b;
	set<ll> c;

	REP(i, n)
	{
		cin >> a[1 << i];
		c.insert(a[1 << i]);
	}
	int cnt = 0;

	FOR(i, 1, 1 << n)
	{
		int x = 1;
		REP(j, n)
		{
			if (a.count(i & (1 << j)) == 0)continue;
			x *= a[i &(1 << j)];
		}
		b[x] = h / x - (l-1)/x;
		
	}

	for (auto i = b.begin(); i != b.end(); ++i)
	{
		if (c.count(i->first))
		{
			cnt += i->second;
		}
		else
		{
			int x = 0;
			REP(k, n)
			{
				if (i->first % a[1 << k] == 0)x++;
			}
			cnt -= i->second*x;
		}
	}
	COUT(cnt);
}