from itertools import combinations
from math import lcm


def f(n, vs: list[int]):
    res = 0
    for i in range(1, len(vs)+1):
        for cs in combinations(vs, i):
            x = 1
            for v in cs:
                x = lcm(x, v)

            sgn = 1 if i % 2 == 1 else -1
            res += sgn * (n // x) * i

    return res


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

ans = f(H, C) - f(L-1, C)
print(ans)