output_description: Find the number of chocolate pieces prepared at the beginning of the camp.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      D X
      A_1
      A_2
      :
      A_N
attempt: # -*- coding: utf-8 -*-
  
  #############
  # Libraries #
  #############
  
  import sys
  
  input = sys.stdin.readline
  
  import math
  
  # from math import gcd
  import bisect
  from collections import defaultdict
  from collections import deque
  from functools import lru_cache
  
  
  #############
  # Constants #
  #############
  
  MOD = 10**9 + 7
  INF = float("inf")
  
  #############
  # Functions #
  #############
  
  
  ######INPUT######
  def inputI():
      return int(input().strip())
  
  
  def inputS():
      return input().strip()
  
  
  def inputIL():
      return list(map(int, input().split()))
  
  
  def inputSL():
      return list(map(str, input().split()))
  
  
  def inputILs(n):
      return list(int(input()) for _ in range(n))
  
  
  def inputSLs(n):
      return list(input().strip() for _ in range(n))
  
  
  def inputILL(n):
      return [list(map(int, input().split())) for _ in range(n)]
  
  
  def inputSLL(n):
      return [list(map(str, input().split())) for _ in range(n)]
  
  
  ######OUTPUT######
  def Yes():
      print("Yes")
      return
  
  
  def No():
      print("No")
      return
  
  
  #####Inverse#####
  def inv(n):
      return pow(n, MOD - 2, MOD)
  
  
  ######Combination######
  kaijo_memo = []
  
  
  def kaijo(n):
      if len(kaijo_memo) > n:
          return kaijo_memo[n]
      if len(kaijo_memo) == 0:
          kaijo_memo.append(1)
      while len(kaijo_memo) <= n:
          kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
      return kaijo_memo[n]
  
  
  gyaku_kaijo_memo = []
  
  
  def gyaku_kaijo(n):
      if len(gyaku_kaijo_memo) > n:
          return gyaku_kaijo_memo[n]
      if len(gyaku_kaijo_memo) == 0:
          gyaku_kaijo_memo.append(1)
      while len(gyaku_kaijo_memo) <= n:
          gyaku_kaijo_memo.append(
              gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo), MOD - 2, MOD) % MOD
          )
      return gyaku_kaijo_memo[n]
  
  
  def nCr(n, r):
      if n == r:
          return 1
      if n < r or r < 0:
          return 0
      ret = 1
      ret = ret * kaijo(n) % MOD
      ret = ret * gyaku_kaijo(r) % MOD
      ret = ret * gyaku_kaijo(n - r) % MOD
      return ret
  
  
  ######Factorization######
  def factorization(n):
      arr = []
      temp = n
      for i in range(2, int(-(-(n**0.5) // 1)) + 1):
          if temp % i == 0:
              cnt = 0
              while temp % i == 0:
                  cnt += 1
                  temp //= i
              arr.append([i, cnt])
      if temp != 1:
          arr.append([temp, 1])
  
      if arr == []:
          arr.append([n, 1])
      return arr
  
  
  #####MakeDivisors######
  def make_divisors(n):
      divisors = []
      for i in range(1, int(n**0.5) + 1):
          if n % i == 0:
              divisors.append(i)
              if i != n // i:
                  divisors.append(n // i)
      return divisors
  
  
  #####LCM#####
  def lcm(a, b):
      return a * b // gcd(a, b)
  
  
  #####BitCount#####
  def count_bit(n):
      count = 0
      while n:
          n &= n - 1
          count += 1
      return count
  
  
  #####ChangeBase#####
  def Base_10_to_n(X, n):
      if int(X / n):
          return Base_10_to_n(int(X / n), n) + [X % n]
      return [X % n]
  
  
  #############
  # Main Code #
  #############
  
  N = inputI()
  D, X = inputIL()
  A = inputILs(N)
  
  C = sum([(D - 1) // a + 1 for a in A])
  
  print(C + X)
  
problem_description: Statement
  
  Some number of chocolate pieces were prepared for a training camp. The camp
  had N participants and lasted for D days. The i-th participant (1 \leq i \leq
  N) ate one chocolate piece on each of the following days in the camp: the 1-st
  day, the (A_i + 1)-th day, the (2A_i + 1)-th day, and so on. As a result,
  there were X chocolate pieces remaining at the end of the camp. During the
  camp, nobody except the participants ate chocolate pieces.
  
  Find the number of chocolate pieces prepared at the beginning of the camp.
samples: [{"input": "3\n    7 1\n    2\n    5\n    10", "output": "8\n    \n\nThe camp has 3 participants and lasts for 7 days. Each participant eats\nchocolate pieces as follows:\n\n  * The first participant eats one chocolate piece on Day 1, 3, 5 and 7, for a total of four.\n  * The second participant eats one chocolate piece on Day 1 and 6, for a total of two.\n  * The third participant eats one chocolate piece only on Day 1, for a total of one.\n\nSince the number of pieces remaining at the end of the camp is one, the number\nof pieces prepared at the beginning of the camp is 1 + 4 + 2 + 1 = 8.\n\n* * *"}, {"input": "2\n    8 20\n    1\n    10", "output": "29\n    \n\n* * *"}, {"input": "5\n    30 44\n    26\n    18\n    81\n    18\n    6", "output": "56"}]