from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def gcd(a,b):
    while b:a,b=b,a%b
    return a

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

# 包除原理かな
def main():
    n,l,h=MI()
    cc=LI()

    # t以下で、条件を満たす整数の個数を返す
    def cal(t):
        popcnt=lambda x:bin(x).count("1")
        res=0
        for bit in range(1,1<<n):
            L=1
            for i in range(n):
                if bit>>i&1:L=lcm(L,cc[i])
            pc=popcnt(bit)
            if popcnt(bit)&1:res+=(t//L)*pc
            else:res-=(t//L)*pc
        return res

    print(cal(h)-cal(l-1))

main()