#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
  }*/

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

signed main(){
  int n, l, h;
  cin >> n >> l >> h;

  vi c(n);
  rep(i, 0, n) cin >> c[i];

  int ans = 0;
  rep(i, 1, 1<<n){
    int lcm = 1;
    rep(j, 0, n) if(i & 1<<j){
      lcm = lcm*c[j]/gcd(lcm, c[j]);
    }

    int tmp = h/lcm - (l-1)/lcm;
    int p = __builtin_popcount(i);
//    cout << i << " " << p << " " << lcm << " " << tmp << endl;

    if(p%2 == 0){
      ans -= tmp*p;
    }else{
      ans += tmp*p;
    }
  }

  cout << ans << endl;

  return 0;
}