#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

int main(){
  int n;long l,h;
  cin>>n>>l>>h;
  vector<long> vec(n);
  rep(i,n) cin>>vec[i];

  long ans = 0;
  repl(i,1,n+1){
    int comb = (1<<i)-1;
    while(comb < 1 << n){
      int cnt = __builtin_popcount(comb);
      long ml = 1;
      bool flg = true;
      rep(j,n) if(comb&(1<<j)){
        if(ml==0) ml = vec[j];
        else {
          ml = ml * vec[j] / __gcd(ml,vec[j]);
        }
        if(ml > h){flg = false; break; }
      }
      if(flg){
        long tmp = (h/ml - (l-1)/ml);
        if(cnt%2==1) ans += cnt * tmp;
        else ans -= cnt * tmp;
      }
      int x = comb&-comb;
      int y = comb+x;
      comb = ((comb&~y)/x >> 1)|y;
    }
  }

  cout << ans << endl;

  return 0;
}