def gcd(x,y):
    while x%y:
        x,y=y,x%y
    return y
def bb(l,d):
    return l//d

n,l,h=map(int,input().split())
c=list(map(int,input().split()))
ans=0
for i in range(1,1<<n):
    d=1;s=-1;p=0
    for j in range(n):
        if i>>j&1:
            s*=-1;d=min(1<<30,d*c[j]//gcd(d,c[j]));p+=1
    ans+=s*(bb(h,d)-bb(l-1,d))*p
print(ans)