#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; 
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int n;
vector<ll> c;


ll solve(ll k){
    ll ret=0;
    rep(i,n){
        for(int bit=0;bit<(1<<n);bit++)if((bit>>i)&1){
            //lcm計算
            ll l=c[i];
            rep(j,n)if(i!=j)if((bit>>j)&1){
                l=l/gcd(l,c[j])*c[j];
                if(l>INF){
                    l=LINF;
                    break;
                }
            }
            ret+=(__builtin_parity(bit)?(k/l):-(k/l));
        }
    }
    return ret;
}

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

    ll l,h;cin>>n>>l>>h;
    c.resize(n);
    rep(i,n)cin>>c[i];
    cout<<solve(h)-solve(l-1)<<endl;
    return 0;
}