//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
//template<class T>void max(T a,T b){if(a<b)return b;else return a;}
//template<class T>void min(T a,T b){if(a>b)return b;else return a;}
//template<class T>bool Max(T&a, T b){if(a < b){a = b;return 1;}return 0;}
//template<class T>bool Min(T&a, T b){if(a > b){a = b;return 1;}return 0;}

//////////////////////////

ll gcd(ll a,ll b){
    if(a>b)swap(a,b);
    if(a==0)return b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a*b/gcd(a,b);
}

ll n,l,h;
ll a[15];
ll solve(ll t){
    ll s1=0;
    rep(i,1,(1<<n)-1){
        ll g=1,c=0;
        bool big=false;
        rep(j,0,n-1){
            if(i&(1<<j)){
                c++;
                g=lcm(g,a[j]);
                if(g>1E9)big=true;
            }
        }
        if(big)continue;
        if(c%2==1){
            s1+=t/g*c;
        }else{
            s1-=t/g*c;
        }
    }
    return s1;
}

ll solve2(ll t){
    ll res=0;
    rep(i,1,t){
        ll c=0;
        rep(j,0,n-1){
            if(i%a[j]==0)c++;
        }
        if(c==1)res++;
    }
    return res;
}
int main(){fastio
    cin>>n>>l>>h;
    rep(i,0,n-1)cin>>a[i];
    /*
    solve(3);
    rep(x,1,20){
        cout<<x<<" "<<solve(x)<<endl;
    }*/
    
    cout<<solve(h)-solve(l-1)<<endl;
    return 0;
}