#line 2 "library/src/template.hpp"
#include<bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define all(x) (x).begin(),(x).end()
#define popcount(x) __builtin_popcount(x)
using i128=__int128_t;
using ll = long long;
using ld = long double;
using graph = std::vector<std::vector<int>>;
using P = std::pair<int, int>;
constexpr int inf = 1e9;
constexpr ll infl = 1e18;
constexpr ld eps = 1e-6;
const long double pi = acos(-1);
constexpr uint64_t MOD = 1e9 + 7;
constexpr uint64_t MOD2 = 998244353;
constexpr int dx[] = { 1,0,-1,0 };
constexpr int dy[] = { 0,1,0,-1 };
template<class T>constexpr inline void chmax(T&x,T y){if(x<y)x=y;}
template<class T>constexpr inline void chmin(T&x,T y){if(x>y)x=y;}
#line 2 "main.cpp"
using namespace std;
int n, l, h;
int c[10];
/// iのみで割り切れるような数 
ll solve(int i) {
    vector<ll> cv;
    rep(j, n) if (j != i) cv.emplace_back(c[j]);
    ll res = 0;
    for (int msk = 0; msk < (1 << (n - 1)); ++msk) {
        bool flag = true;
        ll mul = c[i];
        rep(j, n - 1) if ((msk >> j) & 1) {
            mul = lcm(mul, cv[j]);
            if (mul >= inf) {
                flag = false;
                break;
            }
        }
        if (!flag) continue;

        ll hi = h / mul, lo = (l - 1) / mul;

        res += (~popcount(msk) & 1 ? 1 : -1) * (hi - lo);
    }
    return res;
}
int main() {
    cin >> n >> l >> h;
    rep(i, n) cin >> c[i];
    ll ans = 0;
    rep(i, n) { ans += solve(i); }
    cout << ans << '\n';
}