#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)

int N;
i64 L,H;

i64 gcd(i64 a,i64 b){
  if(b == 0) return a;
  return gcd(b , a % b);
}

i64 lcm(i64 a,i64 b){
  return a / gcd(a,b) * b;
}

int main(){
  cin >> N >> L >> H;

  vector<i64> C(N);

  rep(i,0,N - 1) cin >> C[i];

  vector<i64> LCM((1 << N),-1);
  rep(i,0,N - 1){
    LCM[1 << i] = C[i];
  }
  i64 sum = 0;
  rep(i,1,(1 << N) - 1){
    if(LCM[i] == -1){
      int before = i - (i & -i);
      int index = 0;
      rep(j,0,N - 1){
        if((i & -i) & (1 << j)){
          index = j;
          break;
        }
      }
      LCM[i] = lcm(LCM[before],C[index]);
    }

    i64 res = H / LCM[i] - (L - 1) / LCM[i];
    i64 p;
    if(__builtin_popcount(i) & 1) p = 1;
    else p = -1;
    sum += res * p * __builtin_popcount(i);
  }

  cout << sum << endl;
}