from math import gcd

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

def lcm(a, b):
    return a*b//gcd(a, b)

def func(n, R):
    A = []
    for i in range(N):
        if i != n:
            A.append(lcm(C[i], C[n]))
    ans = 0
    for bit in range(1, 1<<(N-1)):
        LCM = 1
        cnt = 0
        for i in range(N-1):
            if 1<<i & bit:
                LCM = lcm(LCM, A[i])
                cnt += 1
        if cnt % 2 == 1:
            ans += R//LCM
        else:
            ans -= R//LCM
    return R//C[n]-ans

ans = 0
for i in range(N):
    ans += func(i, H)-func(i, L-1)

print(ans)