#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define ERASE(vec, val) vec.erase(remove(vec.begin(), vec.end(), val), vec.end());
#define out(...) //printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,L,H;

void solve() {
    cin>>N>>L>>H;
    L--;
    vector<int> C(N);
    REP(i,N)cin>>C[i];
    
//    vector<int> removes;
//    REP(i,N-1)FOR(j,i+1,N) {
//        int iv = C[i];
//        int jv = C[j];
//        if (iv > jv) swap(iv,jv);
//        if (jv%iv==0) {
//            removes.push_back(jv);
//        }
//    }
//    for (auto v:removes) ERASE(C,v);
    
    int ans = 0;
    FOR(i,1,1<<C.size()) {
        bitset<11> bit(i);
        int base = 1;
        REP(j,C.size()) {
            if (bit[j]) base *= C[j];
        }
        int cntL = L/base;
        int cntH = H/base;
        int diff = cntH - cntL;
        if (bit.count()%2) {
            ans += diff * bit.count();
            out("%6lld: + %lld * %zu\n", base, diff, bit.count());
        } else {
            ans -= diff * bit.count();
            out("%6lld: - %lld * %zu\n", base, diff, bit.count());
        }
    }
    
    cout << ans << endl;
}