#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for (int i = 0; i < (n); ++i)
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; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
ll gcd(ll a,ll b){
    return (b?gcd(b,a%b):a);
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,l,h;cin >> n >> l >> h;
    vector<int> c(n);
    rep(i,n) cin >> c[i];
    l--;
    ll ansl=0,ansh=0;
    for(int i=1;i<(1<<n);i++){
        int cnt=0;
        ll lcm=1;
        rep(j,n){
            if(i&(1<<j)){
                cnt++;
                lcm=lcm/gcd(lcm,c[j])*c[j];
                if(lcm>h){
                    break;
                }
            }
        }
        if(lcm>h){
            break;
        }
        if(cnt%2==0){
            ansl-=l/lcm*cnt;
            ansh-=h/lcm*cnt;
        }
        else{
            ansl+=l/lcm*cnt;
            ansh+=h/lcm*cnt;
        }
    }
    cout << ansh-ansl << endl;
}