#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < (n);i++)
using ll = long long;
using P =pair<int,int>;
ll INF = 1LL << 60;
ll gcd(int a,int b){
  if(b == 0)return a;
  else return gcd(b,a%b);
}
int main(){
  ll n,h,l;
  cin >> n >> l >> h;
  vector<int> C(n);
  rep(i,n) cin >> C[i];
  ll ans = 0;
  for(int i = 1;i < (1<<n);i++){
    ll res = 1;
    rep(j,n){
      if(i >> j & 1){
        res = res * C[j] / gcd(res,C[j]);
      }
    }
    ll k = h/res - (l-1)/res;
    int num = __builtin_popcountll(i);
    if(num % 2 == 1)ans += k*num;
    else ans -= k*num;
  }
  cout << ans << endl;
}