from math import gcd
def lcm(x,y):
    return x*y//gcd(x,y)

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

ANS=0

for i in range(1,1<<N):
    x=1
    count=0
    for j in range(N):
        if i & (1<<j) != 0:
            x=lcm(x,C[j])
            count+=1

    if count%2==1:
        ANS+=(H//x - (L-1)//x)*count
    else:
        ANS-=(H//x - (L-1)//x)*count

print(ANS)