#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

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

int f(vector<ll> A,ll low,ll high){
  int n_=A.size();
  if(n_==0){
    return high-low+1;
  }
  int U=(1 << n_);
  ll res=0;
  rep(S,U+1){
    int s=0;ll lc=1;
    rep(k,n_){
      if(S & (1 << k)) {
        lc=lcm(lc,A[k]);
        s+=1;
      }
    }
    //cout << lc << endl;
    if(s%2==1) res+=high-low+1-high/lc+(low-1)/lc;
    else res-=high-low+1-high/lc+(low-1)/lc;
  }
  return res;
}

int n;ll l,h,c[12];

void solve(){
  cin >> n >> l >> h;
  rep(i,n){
    cin >> c[i];
  }
  int U=(1 << n);
  int s=0;
  ll ans=0;
  rep(i,n){
    vector<ll> a;
    rep(j,n){
      if(j!=i) a.push_back(c[j]/gcd(c[j],c[i]));
    }
    //cout << (l-1)/c[i] << " " << h/c[i] << endl;
    //cout << f(a,(l-1)/c[i]+1,h/c[i]) << endl;
    ans+=f(a,(l-1)/c[i]+1,h/c[i]);
  }
  cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}