#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for(ll i = p; i >= (ll)(n); i-- )
using namespace std;
using ll = long long;
double pi=3.141592653589793;
const long long inf=2*1e9;
const long long linf=8*1e18;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
//atcoder
#include <atcoder/modint>
#include <atcoder/dsu>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;

ll L, R;

ll check(vector<ll> &G) {
    ll P=G.size();
    //最小公倍数を求める
    ll A=1;
    rep(i, 0, P) {
        ll B=gcd(A, G.at(i));
        A/=B;
        if (1e9/G.at(i)<A) {
            return 0;
        }
        else {
            A*=G.at(i);
        }
    }
    return (R/A)-((L-1)/A);
}

int main() {
    ll N;
    cin >> N >> L >> R;
    vector<ll> v(N);
    rep(i, 0, N) {
        cin >> v.at(i);
    }
    ll ans=0;
    rep(i, 1, (1<<N)) {
        vector<ll> G(0);
        rep(j, 0, N) {
            if (i & (1<<j)) {
                G.push_back(v.at(j));
            }
        }
        if (G.size()%2==0) {
            ans-=check(G)*G.size();
        }
        else {
            ans+=check(G)*G.size();
        }
    }
    cout << ans;
}