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: n = int(input())
  d, x = map(int, input().split())
  a = []
  for i in range(n):
      a.appned(int(input())
  s = 0
  for i in range(d):
      for j in range(n):
          if i % a[j] == 1:
              s +=1
  print(s+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"}]