#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr ll MOD = 1e12;
constexpr double PI = 3.14159265358979323846;

ll gcd(ll i,ll j){
    if(j == 0) return i;
    return gcd(j,i%j);
}

ll lcm(ll i,ll j){
    return i / gcd(i,j) * j;
}


ll count(ll p,ll l,ll h){
    ll a = (l+p-1)/p;
    ll b = h/p ;
    return max(b-a+1,0LL);
}

int main(){
    int n;
    ll l,h;
    cin >> n >> l >> h;
    vector<ll> c(n);
    rep(i,n) cin >> c[i];
    ll ans = 0;
    for(int bit=0;bit<(1<<n);bit++){
        bool overflow = false;
        int cnt = 0;
        ll res = 1;
        for(int i=0;i<n;i++){
            if(bit>>i & 1){
                ll p = lcm(res,c[i]);
                if(p > h){
                    overflow = true;
                    break;
                }else{
                    res = p;
                    ++ cnt;
                }
            }
        }
        if(!overflow) ans += cnt * (cnt%2==0?-1:1) * count(res,l,h);
    }
    cout << ans << endl;
    return 0;
}