#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long

using namespace std;

LL gcd(LL a,LL b){
    return b==0 ? a:gcd(b,a%b);
}

LL lcm(LL a,LL b){
    return a*b/gcd(a,b);
}

int N,L,H;
LL C[10];

LL numDivide(int n){
    LL ans=0;

    for (int i = 1;i<(1<<N); i++) {

        int count=0;
        for(int j=i;j>0;j>>=1)count+=(j&1);
        LL Lcm=1;
        for(int j=0;j<N;j++){
            if(i>>j&1){
                Lcm = Lcm/gcd(Lcm , C[j])*C[j];
                if(Lcm > n)break;
            }
        }
        if(count%2==0){
            ans -=count* (n / Lcm);
        }else{
            ans += count*(n / Lcm);
        }
    }

    return ans;
}

int main(){

    cin>>N>>L>>H;
    REP(i,N)cin>>C[i];

    cout<<numDivide(H)-numDivide(L-1)<<endl;


    return 0;
}