#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, L, H;
    cin >> N >> L >> H;
    vector<ll> C(N);
    for(int i = 0; i < N; ++i)  cin >> C[i];

    ll ans = 0;
    for(int i = 0; i < N; ++i){
        vector<ll> num;
        for(int j = 0; j < N; ++j){
            if(j != i)  num.emplace_back(C[j]);
        }
        ll cnt = H / C[i] - (L - 1) / C[i];
        int sz = num.size();
        for(int mask = 1; mask < 1 << sz; ++mask){
            ll prod = C[i];
            for(int j = 0; j < sz; ++j){
                if(mask >> j & 1){
                    prod /= gcd(prod, num[j]);
                    prod *= num[j];
                    if(prod > H){
                        prod = -1;
                        break;
                    }
                }
            }
            if(prod > 0){
                cnt += (H / prod - (L - 1) / prod) * (__builtin_popcount(mask) % 2 == 0 ? 1 : -1);
            }
        }
        ans += cnt;
    }

    cout << ans << endl;

    return 0;
}