#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll n,l,h;
vl c(10);
ll solve(ll p){//p以下について
    vl dp(1<<n);
    rep(bit,1<<n){
        ll now=1;
        rep(i,n){
            if(bit>>i&1){
                now=lcm(now,c[i]);
                if(now>p){
                    now=INF;break;
                }
            }
        }
        dp[bit]=p/now;
    }
    rep(i,n){
        rep(bit,1<<n){
            if(bit>>i&1)continue;
            dp[bit]-=dp[bit|(1<<i)];
        }
    }
    ll ans=0;
    rep(bit,1<<n){
        if(__builtin_popcount(bit)==1)ans+=dp[bit];
    }
    return ans;
}
int main(){
    cin >> n >> l >> h;
    rep(i,n)cin >> c[i];
    cout << solve(h)-solve(l-1) << endl;
}