#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

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

    ll N,L,H; cin >> N >> L >> H;
    vector<ll> C(N);
    rep(i,N) cin >> C[i];

    auto lcm = [&](vector<ll> v){
        ll ret = v[0];
        for(int i = 1; i < (int)v.size(); i++){
            ret = ret / __gcd(ret, v[i]) * v[i];
            ret = min(ret, (ll)1e9+1);
        }
        return ret;
    };

    auto f = [&](ll n, ll x){
        return n / x;
    };

    // M以下
    auto solve = [&](ll M){
        ll ans = 0;
        rep(i,1<<N){
            if(i == 0) continue;
            vector<ll> v;
            rep(j,N) if(i & (1 << j)) v.push_back(C[j]);
            ll bcnt = __builtin_popcount(i);
            if(bcnt & 1){
                ans += bcnt * f(M, lcm(v));
            }else{
                ans -= bcnt * f(M, lcm(v));
            }
        }
        return ans;
    };

    cout << solve(H) - solve(L - 1) << endl;
}