#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
using namespace std;
typedef long long ll;

int N;
ll L, H, C[10];

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

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

ll div_count(ll p) {
  ll l = (L + (p - L % p) % p), h = (H - H % p);
  ll n = (h - l) / p + 1;
  return n;
}

int main(void) {
  cin >> N >> L >> H;
  REP(i, 0, N) cin >> C[i];

  ll fact[11];
  fact[0] = 1;
  REP(i, 0, 10) fact[i + 1] = fact[i] * (i + 1);

  ll ans = 0;
  REP(i, 1, N + 1) {
    ll a[20];
    REP(i, 0, N) a[i] = i;
    set< vector<ll> > st;
    do {
      vector<ll> v;
      REP(j, 0, i) v.push_back(a[j]);
      st.insert(v);
    } while(next_permutation(a, a + N));

    ll cnt = 0;
    for(vector<ll> v : st) {
      ll p = 1;
      REP(i, 0, v.size()) p = lcm(p, C[v[i]]);
      cnt += div_count(p);
    }
    cnt /= fact[i];

    ans += (i % 2 == 0 ? -1 : 1) * i * cnt;
  }
  cout << ans << endl;
}