//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

int64_t gcd(int64_t a, int64_t b) {return b?gcd(b, a%b):a;}
int64_t lcm(int64_t a, int64_t b) {return (ll)min((ld)a/gcd(a,b)*b, (ld)1e17);}
int64_t extgcd(int64_t a, int64_t b, int64_t &x, int64_t &y) { // ax+by=gcd(a, b)の解を与える
    int64_t d = a;
    if(b) {
        d = extgcd(b, a%b, y, x);
        y -= (a/b)*x;
    } else {
        x = 1; y = 0;
    }
    return d;
}

int func(int d, vi &c) {
    if(!d) return 0;
    int n = c.size();
    vi dp(1<<n);
    for(int i = 1; i < 1<<n; i++) {
        ll x = 1;
        rep(j, n) if(i>>j&1) {
            x = lcm(x, c[j]);
        }
        dp[i] = d/x;
    }
    rep(i, n) rep(j, 1<<n) {
        if(j>>i&1) dp[j] -= dp[j^(1<<i)];
    }
    int res = 0;
    rep(i, 1<<n) dp[i] = abs(dp[i]);
    rep(i, n) {
        res += dp[(1<<n)-1] - dp[(1<<n)-1-(1<<i)];
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, l, h;
    cin >> n >> l >> h;
    vi c(n);
    rep(i, n) cin >> c[i];

    cout << func(h, c)-func(l-1, c) << endl;
}