#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

ll C[17];

// 包除原理(積集合→和集合)

int main(){
  ll N,L,H;
  cin >> N >> L >> H;
  vector<ll> flag((1<<N)+7);
  rep(i,N){
    cin >> C[i];
  }
  ll SIZE=N;
  // それぞれの積集合を求める
  rep(bit,1<<SIZE){
    ll X,Y=1;
    rep(digit,SIZE){
      if(bit & 1<<digit){
        Y=lcm(Y,C[digit]);
      }
    }
    X=H/Y-(L-1)/Y;
    flag[bit]=X;
  }

  ll SUM1=0;
  rep(bit, 1<<SIZE){
    if(bit==0){
      continue;
    }
    ll sumbit=__builtin_popcount(bit);
    ll X=1;
    if(sumbit%2==0){
      X=-X;
    }
    SUM1+=flag[bit]*X;
  }

  // 和集合を求める
  ll ANS=0;
  rep(i,N){
    ll SUM=0;
    rep(bit, 1<<SIZE){
      if(bit & 1<<i){
        continue;
      }
      if(bit==0){
        continue;
      }
      ll sumbit=__builtin_popcount(bit);
      ll X=1;
      if(sumbit%2==0){
        X=-X;
      }
      SUM+=flag[bit]*X;
    }
    ANS+=SUM1-SUM;
  }
  cout << ANS << endl;
}