#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
ll L, H;
ll c[11];

ll lcm[1<<11];

int bitcount(int bits) {
    bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
    bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
    bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
    bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
    return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}

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

ll LCM(ll a, ll b) {
    return a * b / GCD(a, b);
}

ll calc(ll k) {
    ll m = (H - L + 1) / k;
    if ((H - L + 1) % k == 0) return m;
    ll p = L + k * m;
    return m + (p%k==0 || p%k>H%k);
}

ll solve() {
    for (int i = 1; i < (1<<n); i++) {
        lcm[i] = 1;
        for (int j = 0; j < n; j++) {
            if ((i>>j) & 1) {
                lcm[i] = LCM(lcm[i], c[j]);
                if (lcm[i] > H) {
                    lcm[i] = 0;
                    break;
                }
            }
        }
    }

    ll res = 0;
    for (int i = 1; i < (1<<n); i++) {
        int b = bitcount(i);
        if (lcm[i] > 0)
            res += calc(lcm[i]) * b * (b%2?1:-1);
    }
    return res;
}

void input() {
    cin >> n >> L >> H;
    for (int i = 0; i < n; i++) cin >> c[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}