from math import lcm


def f(x, vs):
    sz = len(vs)
    cnt = [0] * (1 << sz)

    for i in range(1 << sz):
        l = 1
        for j in range(sz):
            if i & (1 << j):
                l = lcm(l, vs[j])

        cnt[i] = x // l

    for i in range(sz):
        for j in range(1 << sz):
            if ~j & (1 << i):
                cnt[j | (1 << i)] -= cnt[j]

    res = 0
    for i in range(sz):
        u = ((1 << sz) - 1) ^ (1 << i)
        v = ((1 << sz) - 1)
        res += abs(cnt[u]) - abs(cnt[v])

    return res


N, L, H = map(int, input().split())
C = list(map(int, input().split()))

ans = f(H, C) - f(L-1, C)
print(ans)