n,L,R=map(int,input().split())
a=list(map(int,input().split()))
from math import gcd
q=[0]*(1<<n)
for i in range(1<<n):
  p=1
  for j in range(n):
    if (i>>j)&1:
      p=(p*a[j])//gcd(p,a[j])
  q[i]=R//p-(L-1)//p
for j in range(n):
  for i in range(1<<n):
    if (i>>j)&1==0:
      q[i]-=q[i|(1<<j)]
print(sum(q[i] for i in range(1<<n) if i.bit_count()==1))