#include <bits/stdc++.h>
using namespace std;
long long F(int R, int N, vector<long long> d) {
  long long ans = 0;
  for (int i = 1; i < (1 << N); i++) {
    int c = __builtin_popcount(i);
    if (__builtin_parity(i) == 1) {
      ans += c * (R / d[i]);
    } else {
      ans -= c * (R / d[i]);
    }
  }
  return ans;
}
int main() {
  int N, L, H;
  cin >> N >> L >> H;
  vector<long long> C(N);
  for (int i = 0; i < N; i++) {
    cin >> C[i];
  }
  vector<long long> d(1 << N);
  d[0] = 1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < (1 << N); j++) {
      if (j >> i & 1) {
        d[j] = d[j - (1 << i)] * C[i] / __gcd(d[j - (1 << i)], C[i]);
        if (d[j] > 1E9) {
          d[j] = 1E9 + 1;
        }
      }
    }
  }
  long long ans = F(H, N, d) - F(L - 1, N, d);
  cout << ans << endl;
}