#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

ll N, L, H;

ll countMultiple(ll x) {
  if(x==0) return 0;
  return H / x - (L-1) / x;
}
//最大公約数
ll gcd(ll a, ll b) {
  while (a && b) {
    if (a >= b) a %= b;
    else b %= a;
  }
  return a + b;
}
int main()
{
  cin>>N>>L>>H;
  ll C[N];
  FOR(i,0,N) cin>>C[i];
  ll ans = 0;
  FOR(i,0,(1<<N)) {
    int cnt = 0;
    ll c = 1;
    FOR(j,0,N) {
      if((i>>j)&1) {
        cnt++;
        c *= C[j]/gcd(c, C[j]);
        if(c > H) c = 0;
      }
    }
    if(cnt % 2 == 1) {
      ans += cnt * countMultiple(c);
    } else if(cnt % 2 == 0){
      ans -= cnt * countMultiple(c);
    }
  }
  cout << ans << endl;
  return 0;
}