import strutils, sequtils, algorithm, future, math

{.warning[SmallLshouldNotBeUsed]: off.}

proc cnt(x, n: int, a: seq[int]): int =
  for i in 0..<(1 shl a.len):
    if i.toBin(a.len+1).count('1') != n: continue
    var l = 1
    for j in 0..<a.len:
      if ((i shr j) and 1) != 1: continue
      l = lcm(l, a[j])
    result += (x div l)*n


when isMainModule:
  var
    input = stdin.readLine.split.map(parseInt)
    (n, l, h) = (input[0], input[1], input[2])
    a = stdin.readLine.split.map(parseInt)
    x, y: int64 = 0

  for i in 1..n:
    if i mod 2 == 1:
      x += cnt(l-1, i, a)
      y += cnt(h, i, a)
    else:
      x -= cnt(l-1, i, a)
      y -= cnt(h, i, a)

  echo y - x