#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);


    ll N,L,H;
    cin>>N>>L>>H;
    ll an=0;
    vll C(N);
    rep(i,N)cin>>C[i];
    rep(bit,(1<<N)){
        ll res=1;
        ll k=0;
        rep(n,N){
            if(bit&(1<<n)){
                res=C[n]/gcd(res,C[n])*res;k++;}
            if(res>H)break;
        }    
        if(k==0)continue;
        ll d=(H/res)-(L-1)/res;
        d*=k;
        //cout<<bit<<" "<<d<<endl;
        an+=(k%2==1?d:-d);
    }
    cout<<an<<endl;
}