#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 100010;
const int mod = 998244353;
int a[N], f[N], g[N];
inline int lcm(int a, int b) {
    return a / __gcd(a, b) * b;
}
signed main() {
    cin.tie(0)->sync_with_stdio(false);
    int n, l, r; cin >> n >> l >> r;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    int cnt = 0;
    for (int i = 0; i < (1 << n); ++i) {
        g[i] = 1;
        for (int j = 0; j < n; ++j) if (i >> j & 1) {
            g[i] = lcm(g[i], a[j + 1]);
            if (g[i] > 2e9) break;
        }
        if (g[i] <= 2e9) f[i] = r / g[i] - (l - 1) / g[i];
    }
    int s = 0;
    for (int i = (1 << n) - 1; ~i; --i)
        if (g[i] <= 2e9) {
            for (int j = i + 1; j < (1 << n); ++j)
                if (g[j] % g[i] == 0) f[i] -= f[j];
            if (__builtin_popcount(i) == 1) s += f[i];
        }
    cout << s << '\n';
    return 0;
}