Problem:
 Score : 200 points    Problem 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.      Constraints  1 \leq N \leq 100  1 \leq D \leq 100  1 \leq X \leq 100  1 \leq A_i \leq 100 ( 1 \leq i \leq N )  All input values are integers.         Input Input is given from Standard Input in the following format:  N  D  X  A_1  A_2  :  A_N       Output Find the number of chocolate pieces prepared at the beginning of the camp.        Sample Input 1 3
7 1
2
5
10      Sample Output 1 8  The camp has 3 participants and lasts for 7 days.
Each participant eats chocolate pieces as follows:   The first participant eats one chocolate piece on Day 1 , 3 , 5 and 7 , for a total of four.  The second participant eats one chocolate piece on Day 1 and 6 , for a total of two.  The third participant eats one chocolate piece only on Day 1 , for a total of one.   Since the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is 1 + 4 + 2 + 1 = 8 .       Sample Input 2 2
8 20
1
10      Sample Output 2 29       Sample Input 3 5
30 44
26
18
81
18
6      Sample Output 3 56

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

N = ri()
D, X = ri_()
A = [ri() for _ in range(N)]
E = [(D - 1) // i + 1 for i in A]
print(sum(E) + X)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
ans=x
a=[int(input()) for i in range(n)]
for i in range(n):
    c=(d-1)//a[i]+1
    ans+=c
print(ans)

Solution (Python):
import math
n = int(input())
d , x = map(int , input().split())
total = x
d -= 1

for i in range(n):
  a = int(input())
  total += math.floor(d / a) + 1

print(total)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
cnt = x
for i in range(n):
    ai = int(input())
    cnt += -(-d // ai)
print(cnt)

Solution (Python):
N = int(input())
D,X = map(int,input().split())
A = [int(input()) for i in range(N)]

sum = N

for i in range(N):
    cnt = 1    
    while True: 
        if cnt*A[i]+1 <= D:
            sum += 1
            cnt += 1
        else :
            break
            
print(sum + X)

Solution (Python):

import sys
input = sys.stdin.readline









N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]
 
from math import ceil
ans = 0
for i in range(N):
    ans += ceil(D/A[i])
 
print(ans+X)

Solution (Python):
N = int(input())
D,X = map(int, input().split())
ans = 0

for i in range(N):
    A = int(input())
    j = 0
    while (j*A + 1) <= D:
        j += 1
    ans += j

print(ans + X)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
A =[]
ans = x

for i in range(n):
  a = int(input())
  A.append(a)
  
for i in range(n):
  if d%A[i] != 0:
    ans += d//A[i] + 1
  elif d%A[i] == 0:
    ans += d//A[i]
  
print(ans)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = X
for i in range(N):
    k = 0
    d = 1
    while d <= D:
        ans += 1
        k += 1
        d = 1 + k * A[i]
print(ans)

Solution (Python):
import numpy as np

n = int(input())
d, x = map(int, input().split())

for i in range(n):
  a = int(input())
  k = np.floor((d-1)/a) + 1
  x += k

print(int(x))

Solution (Python):
import math
n=int(input())
d,x=map(int,input().split())
ans=0
for i in range(n):
  a=int(input())
  ans+=math.ceil(d/a)
print(ans+x)

Solution (Python):
N = int(input())
D, X = list(map(int, input().split()))
A = [0]*(N+1)
for i in range(1, N+1):
    A[i] = int(input())
ans = X
for i in range(1, N+1):
    day = 1
    while day <= D:
        ans += 1
        day += A[i]
print(ans)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
counts = x
for i in range(n):
    a = int(input())
    count = 1 + (d-1)//a
    counts += count
print(counts)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a = [0]*n
for i in range(n):
  a[i] = int(input())
eaten = 0
for j in range(n):
  eaten += (1+d//a[j]-(d%a[j]==0))
print(eaten+x)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for _ in range(n)]
count=0
for i in range(n):
  count+=(d-1)//a[i]+1
print(count+x)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

n = int(input())
d, x = map(int, input().split())

a = list(int(input()) for i in range(n))

ans = x
for i in range(n):
    ans += 1
    ans += (d-1)//a[i]
print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

n = int(input())
d, x = map(int, input().split())

a = list(int(input()) for i in range(n))

ans = x
for i in range(n):
    ans += 1
    ans += (d-1)//a[i]
print(ans)

Solution (Python):
n = int(input())
d,x = map(int, input().split())

ans = 0
for i in range(n):
    a = int(input())
    ans += (d-1)//a
    ans += 1
print(ans+x)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7


n=I()
d,x=MI()
ans=0
for i in range(n):
    ans+=1+int((d-1)//I())
print(ans+x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
choco = [int(input()) for i in range(N)]

count = 0
for i in range(N):
    count += (D - 1) // choco[i] + 1

print(count + X)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

ans = x
for i in a:
    if d % i == 0:
        ans += d // i
    else:
        ans += d // i + 1

print(ans)

Solution (Python):
N = int(input())
D, X = map(int, input().split())

la = list()
for i in range(N):
    la.append(int(input()))

ans = 0
for i in range(N):
    ans += (D-1)//la[i] + 1

print(ans + X)

Solution (Python):
n= int(input())
d,x=map(int,input().split())
e = [int(input()) for i in range(n)]
choco = x

for i in e:
  day = 1
  while day<=d:
      day = day+i
      choco += 1

print(choco)

Solution (Python):
N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]

d = 1
ans = 0
while d <= D:
    for a in A:
        if a == 1:
            ans += 1
        elif d%a == 1:
            ans += 1
    d += 1

print(ans+X)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
summ=0
for i in range(n):
  summ+=(d-1)//int(input())+1
print(summ+x)

Solution (Python):
def main():
    n = int(input())
    d, x = map(int, input().split())
    a = [int(input()) for _ in range(n)]

    ans = x
    for aa in a:
        if d % aa == 0:
            ans += d//aa
        else:
            ans += d//aa + 1

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = []
for _ in range(n):
    a.append(int(input()))
ans = x
for i in a:
    ans += (d-1)//i + 1
print(ans)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
c=0
for i in range(N):
  A=int(input())
  if D%A==0:
    c+=D//A
  else:
    c+=D//A+1

print(c+X)

Solution (Python):
def solve():
    N = int(input())
    D,X = map(int, input().split())
    A = [int(input()) for _ in range(N)]
    ans = 0
    for i in A:
        appearances = (D + i-1)//i
        ans += appearances
    print(X+ans)



if __name__ == '__main__':
    solve()

Solution (Python):
n = int(input())
d, x = map(int, input().split())
for i in range(n):
    a = int(input())
    c = (d - 1) // a + 1
    x += c
print(x)

Solution (Python):
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

IN=lambda : map(int, input().split())
LIN=lambda : list(IN())
mod=1000000007



def main():
	n = int(input())
	d , x = IN()
	for _ in range(n):
		ai=int(input())
		init=1
		x+=1
		for i in range(1, 1000):
			if ai*i + 1 > d:
				break
			x+=1
	print(x)
	
	
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):
N=int(input())
D,X=map(int, input().split())
A= [int(input()) for i in range(N)]

num=0
for i in range(N):
  num+=1+(D-1)//A[i]
  

print(num+X)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
ans = x

for i in range(n):
    a = int(input())
    ans += (d - 1)//a + 1

print(ans)

Solution (Python):
N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]
ans = 0
for a in A:
    ans += (D-1)//a + 1
print(ans + X)

Solution (Python):
N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]
ans = 0
for a in A:
    ans += (D-1)//a + 1
print(ans + X)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
for _ in range(n):
  a = int(input())
  x += (d-1)//a + 1
print(x)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [0] * n
for i in range(n):
    a[i] = int(input())
t = 0
for i in a:
    t += len([int(y) for y in range(1, d+1, i)])
print(x + t)

Solution (Python):


n=int(input())
d,x=map(int,input().split())
a=[int(input()) for _ in range(n)]

d-=1
for i in a:
    x+=d//i+1
print(x)

Solution (Python):
def multi_input():
    return map(int, input().split())

N = int(input())
D, X = multi_input()
A = [int(input()) for _ in range(N)]

ans = X + N
for a in A:
    ans += (D - 1) // a
print(ans)

Solution (Python):
N = int(input())
D, X = map(int, input().split()) 
ans = 0
for i in range(N):
  a = int(input())
  ans += (D-1)//a+1
print(ans+X)

Solution (Python):
N = int(input())
D , X = map(int, input().split())
A = list(int(input()) for i in range(N))
sum_choco = 0
for a in A:
    if D % a == 0:
        sum_choco += D//a
    else:
        sum_choco += (D//a +1)
print(sum_choco + X)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a =[0]*n
count = 0
for i in range(n):
    a[i] = int(input())
    if d%a[i] == 0:
        count += int(d/a[i])
    else:
        count += int(d/a[i]) + 1
print(count+x)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
A=[]
for i in range(N):
    A.append(int(input()))

num=[]
for j in A:
    count=[]
    for k in range(D):
        if j*k+1<=D:
            count.append(1)
    num.append(len(count))

print(sum(num)+X)

Solution (Python):
N = int(input())
D, X = list(map(int, input().split()))
ans = X
for _ in range(N):
    a = int(input())
    if D % a == 0:
        ans += D // a
    else:
        ans += D // a + 1
print(ans)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]
count = 0
def HowManyDaysEaten(d, a):
    l = list()
    i = 1
    while d >= (i - 1) * a + 1:
        l.append((i - 1) * a + 1)
        i += 1
    return l 
for i in A:
    count += len(HowManyDaysEaten(D, i))
print(count + X)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]
B = []
for i in A:
  n = (D-1)//i+1
  B.append(n)
print(sum(B)+X)

Solution (Python):
N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]

res = 0
for i in range(N):
    res += len(list(range(1,D+1,A[i])))
print(res+X)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]

ans = 0

for a in A:
    p = 1
    while p <= D:
        ans += 1
        p += a
ans += X
print(ans)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
D, X = MAP()
A = [INT() for _ in range(N)]

ans = X

for i in range(N):
	day = 0
	j = 0
	while day <= D:
		day = j*A[i] + 1
		j += 1
	ans += j-1

print(ans)

Solution (Python):
n = int(input())
d , x = map(int,input().split())
for i in range(n):
    a = int(input())
    x += (d-1)//a + 1
print(x)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]
day = 0
while day <= d:
    for i in range(n):
        if day * a[i] + 1 <= d:
            x += 1
    day += 1
print(x)

Solution (Python):
def resolve():
    n=int(input())
    d,x=map(int, input().split())
    l=[int(input()) for i in range(n)]
    tabeta=0
    for i in range(n):
        tabeta+=(d-1)//l[i]+1
    print(x+tabeta)
resolve()

Solution (Python):
import numpy as np
import sys

input = sys.stdin.readline

N = int(input())
D,X = map(int,input().split())

A = []
for i in range(N):
    b =int( input())
    A.append(b)

res = 0
for i in range(100):
    for j in range(N):
        if i*A[j]+1 <= D:
            res+=1

print(res+X)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
for i in range(n):
    x+=(d-1)//int(input())
print(x+n)

Solution (Python):
def resolve():
    n=int(input())
    d,x=map(int, input().split())
    l=[int(input()) for i in range(n)]
    tabeta=0
    for i in range(n):
        cnt=1
        while cnt<=d:
            cnt+=l[i]
            tabeta+=1
    print(x+tabeta)

resolve()

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

eat = 0
for i in range(n):
    one = 1
    while one <= d:
        one += a[i]
        eat += 1
print(x + eat)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = 0
for a in A:
    i = 1
    count = 1
    while count <= D:
        count = 1 + a*i
        ans += 1
        i += 1
ans += X
print(ans)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
count = 0
for i in range(n):
    a = int(input())
    j = 0
    day = 1
    while day+j*a <= d:
        count += 1
        j += 1
print(count+x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]
count = X

A = sorted(A)

for i in range(N):
    a = A[i]
    count +=1
    for j in range(D):
        if a+1<=D:
            count+=1
            a += A[i]
        else:
            break

print(count)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]
ans = x
for i in range(n):
    ans += (d-1)//a[i]+1
print(ans)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a_list = [int(input()) for i in range(n)]
ans = x
for i in range(n):
    for j in range(1, d + 1, a_list[i]):
        ans += 1
print(ans)

Solution (Python):
n = int(input())
d, x = map(int,input().split())
a = [int(input()) for _ in range(n)]

for i in range(n):
    s = 0
    f = 1
    while f <= d:
        x += 1
        f = s * (a[i]) + 1
        s += 1
    x -= 1
print(x)

Solution (Python):
N = int(input())
d, x = map(int, input().split())
A = []
for i in range(N):
    A.append(int(input()))
ans = x
for n in range(N):
    count = 0
    while d >= A[n] *count +1:
        ans += 1
        count += 1
print(ans)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for x in range(n)]
j=1
cnt=0
for i in a:
    while ((j*i)+1)<=d:
        cnt+=1
        j+=1
    j=1
print(cnt+n+x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
li = [int(input()) for _ in range(N)] 
ans = 0
for i in li:
    for j in range(1, D+1, i):
        ans += 1
print(ans+X)

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    n = ni()
    d, x = nm()
    a = [ni() for _ in range(n)]

    ans = 0
    for i in range(n):
        ans += (d - 1) // a[i] + 1

    print(ans + x)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
d, x = map(int, input().split())
use = 0
for i in range(n):
    a = int(input())
    day = 1
    while (day <= d):
        use += 1
        day += a
print(x + use)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
A=[int(input())for _ in range(N)]
cho=0
for i in range(N):
    j=0
    while j*A[i]+1<=D:
        cho+=1
        j+=1
print(cho+X)

Solution (Python):
import sys
readline = sys.stdin.readline
import math

def main():
    N = int(readline())
    D, X = map(int, readline().rstrip().split())
    for _ in range(N):
        a = int(readline())
        X += math.floor((D-1) / a + 1)

    print(X)


if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np
n = int(input())
d, x = map(int, input().split())
chocolate = np.array([0] * d)
for player in range(n):
    chocolate[::int(input())] += 1
print(chocolate.sum() + x)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for _ in range(n)]
ans = 0
for i in a:
    ai = 1
    while ai<=d:
        ai = ai+i
        ans += 1
print(ans+x)

Solution (Python):
import math
N=int(input())
D,X=map(int, input().split())
for i in range(N):
  Ai=int(input())
  X=X+math.floor((D-1)/Ai)+1
print(X)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]


def f(x):
    count = 0
    for i in range(0, D):
        if (i * x + 1 <= D):
            count += 1
        else:
            break
    return count


s = []
for i in range(N):
    s.append(f(A[i]))

print(sum(s) + X)

Solution (Python):

n = int(input())
d, x = map(int, input().split())
nums = []
for _ in range(n):
    nums.append(int(input()))

c = 0
for i in range(n):
    t = 1
    j = 1 + nums[i]
    while j <= d:
        j += nums[i]
        t += 1
    c += t
ans = c + x
print(ans)

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(input())
    D, X = map(int, input().split())
    ans = X
    for _ in range(N):
        ans += (D-1)//(int(input())) + 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for i in range(n)]
ans = x
for i in a:
    ans += (d-1)//i + 1
print(ans)

Solution (Python):
a=int(input())
b=list(map(int,input().split()))
c=[int(input()) for _ in range(a)]
ans=0
for i in range(a):
    ans+=b[0]//int(c[i])+1
for k in range(a):
    if c[k]==1 or b[0]%int(c[k])==0:
        ans-=1
print(ans+b[1])

Solution (Python):
N = int(input())
D, X = map(int, input().split())
ans = 0
for i in range(N):
    for i in range(1, D+1, int(input())):
        ans += 1

print(ans+X)

Solution (Python):
n = int(input())
d,x = map(int, input().split())
a = sum([(d-1)//int(input())+1 for _ in range(n)])+x
print(a)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
print(sum(1+~-D//int(input()) for i in range(N))+X)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A =[int(input()) for _ in range(N)]
cnt = 0
for a in A:
    cnt += (D - 1) // a + 1
print(X+cnt)

Solution (Python):
n = int(input())
d,x = map(int, input().split())
ans = x
for i in range(n):
  ans += (d-1)//int(input())+1
print(ans)

Solution (Python):
N = int(input())
D,X = map(int,input().split(" "))
count = 0
for i in range(N):
    A = int(input())
    i=0
    while(i*A+1<=D):
        count+=1
        i+=1
print(count+X)

Solution (Python):
people = int(input())
i = input().split()
day = int(i[0])
lastchoco = int(i[1])
num = [int(input()) for n in range(people)]
for n in num:
	for nn in range(1,day+1,n):
		lastchoco += 1
print(lastchoco)

Solution (Python):
n = int(input())
d, x = map(int, input().split())

for _ in range(n):
    a = int(input())
    x += 1 + (d-1)//a
    
print(x)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
ans = x
for i in range(n):
  for j in range(1,d+1):
    if j % a[i] - 1 == 0:
      ans += 1
    elif a[i] == 1:
      ans += 1

print(ans)

Solution (Python):
n = int(input())
d, x = [int(x) for x in input().split()]

A = [int(input()) for x in range(n)]

ans = n + x

for i in range(n):
    ans += (d - 1) // A[i]
    
print(ans)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for i in range(n)]
cnt = 0
for i in a:
    day = 1
    while day <= d:
        day += i
        cnt += 1
    
print(cnt + x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
count = 0
for i in range(N):
    A = int(input())
    count += (D-1)//A + 1
print(count+X)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
d-=1

for i in range(n):
  a=int(input())
  x+=1+d//a

print(x)

Solution (Python):
import math
n = int(input())
d,x = map(int,input().split())
li=[int(input()) for _ in range(n)]
cnt=0
for i in li:
    cnt += math.ceil(d/i)
print(cnt+x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = X
for i in range(N):
    cnt = 0
    while A[i]*cnt + 1 <= D:
        ans += 1
        cnt += 1
print(ans)

Solution (Python):
N = int(input())
D, X = map(int,input().split())
ans = X
for _ in range(N):
    A = int(input())
    ans += 1 + (D-1) // A
print(ans)

Solution (Python):
N,D,X,*A=map(int,open(0).read().split());print(X+sum(~-D//i+1 for i in A))

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = 0
for i in range(N):
    ans += ((D-1) // A[i]) + 1
print(ans+X)

Solution (Python):

N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = 0
for i in range(N):
    ans += ((D-1) // A[i]) + 1
print(ans+X)

Solution (Python):
icase=0
if icase==0:
    n=int(input())
    d,x=map(int,input().split()) 
    asum=0
    for i in range(n):
        a=int(input())
        asum=asum+(d-1)//a+1
    print(asum+x)

Solution (Python):
N = int(input())
D, X= map(int, input().split())
A = [0]*N
for i in range(N):
    A[i] = int(input())
t = X
for a in A:
    t += 1 + (D-1) // a
print(t)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a_inputs = [int(input()) for i in range(n)]

ans=x
for a in a_inputs:
    ans+=len([i for i in range(1,d+1) if (i-1)%a==0])
print(ans)

Solution (Python):
def main():
    N = int(input())
    D, X = map(int, input().split())
    chocolate = 0
    for i in range(N):
        A = int(input())
        if A == 1:
            chocolate += D
            continue
        for j in range(1, D + 1):
            if j % A == 1:
                chocolate += 1
    print(X + chocolate)


if __name__ == '__main__':
    main()

Solution (Python):
num_of_participants = int(input())
days, remaining = map(int, input().split())
participants = []
eaten = 0

for i in range(num_of_participants):
    interval = int(input())
    eaten += len(range(1, days + 1, interval))

print(eaten + remaining)

Solution (Python):
n = int(input())
d, ans = map(int,input().split())
a = [int(input()) for i in range(n)]

for i in a:
    j = 1
    while j <= d:
        ans += 1
        j += i

print(ans)

Solution (Python):
n = int(input())
d,x = map(int, input().split())
a = [int(input()) for i in range(n)]

key = 0
ans = 0
for i in range(n):
    if d % a[i] == 0:
        key = d // a[i]
    else:
        key = (d//a[i])+1
    ans += key
    key = 0
print(ans+x)

Solution (Python):

n = int(input())
d,x = map(int,input().split())
a = [int(input()) for _ in range(n)]
ans = 0

for i in range(n):
    t = 0
    while 1 + a[i]*t <= d:
        ans += 1
        t += 1
print(ans+x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
date = []

for i in range(N):
    item = int(input())
    i = 0
    while D >= item * i + 1:
        date.append(item * i + 1)
        i += 1

print(len(date) + X)

Solution (Python):
n = int(input())
d,x = map(int, input().split())
al = [int(input()) for _ in range(n)]

res = 0
for i in range(1,d+1):
    for a in al:
        if (i-1)%a==0:
            res += 1
print(res+x)

Solution (Python):

import sys
try:
    from typing import List
except ImportError:
    pass


def solve(N: int, D: int, X: int, A: "List[int]"):
    print(X + sum(
        -(-D // Ai)
        for Ai in A
    ))


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    D = int(next(tokens))  
    X = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(N, D, X, A)


if __name__ == '__main__':
    main()

Solution (Python):
N=int(input())
D,X=map(int,input().split())

alist=[]
for i in range(N):
  alist.append(int(input()))


choco=0
for i in range(D):
  for a in alist:
    if i%a==0:
      choco+=1
      
print(X+choco)

Solution (Python):
n = int(input())
m,k = map(int,input().split())
    
for i in range(n):
    for j in range(1, m+1, int(input())):
        k += 1
print(k)

Solution (Python):
n = int(input())
m, k = [int(_) for _ in input().split()]
    
for i in range(n):
    for j in range(1, m+1, int(input())):
        k += 1
print(k)

Solution (Python):

import io

n = int(input())
m, k = [int(_) for _ in input().split()]
    
for i in range(n):
    for j in range(1, m+1, int(input())):
        k += 1
print(k)

Solution (Python):
N=int(input())
D,X=map(int,input().split())

alist=[]
for i in range(N):
  alist.append(int(input()))


choco=0
for i in range(1,D+1):
  for a in alist:
    if (i-1)%a==0:
      choco+=1
      
print(X+choco)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for _ in range(n)] 
ans=x
for i in range(n):
    ans+=(d-1)//a[i]+1
print(ans)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a = []
while True:
  try:
    a.append(int(input()))
  except:
    break

lis = []
for i in range(n):
  tmp = d//a[i]
  if d%a[i]!=0:
    tmp +=1
  lis.append(tmp)

ans = sum(lis) + x
print(ans)

Solution (Python):
n=int(input())
d, x=map(int, input().split())
for _ in range(n):
  a=int(input())
  x+=1+(d-1)//a
print(x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]
for a in A:
     X += len(range(1, D+1, a))
print(X)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]
c = 0
for i in range(n):
    D = 1
    while D <= d:
        c += 1
        D += a[i]
print(x + c)

Solution (Python):
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))

def main():
    n = II()
    d, x = MII()
    aa = [II() for _ in range(n)]
    cnt = x
    for a in aa:
        cnt += -(-d//a)
    print(cnt)

if __name__ == '__main__':
    main()

Solution (Python):
n,d,x,*a=map(int,open(0).read().split())
for i in a:
    x+=(d-1)//i+1
print(x)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
for i in range(n):
    x+=(d-1)//int(input())+1
print(x)

Solution (Python):
def main():
    N = int(input())
    D, X = map(int, input().split())
    A = [int(input()) for _ in range(N)]
    choco = 0
    for i in range(N):
        a = A[i]
        for j in range(D):
            if 1 + j*a <= D:
                choco += 1
    print(X + choco)
main()

Solution (Python):
import math
a = int(input())
D, b = map(int, input().split())
c = [int(input()) for i in range(a)]
ans = 0
for i in c:
    ans += math.ceil(D / i)
print(ans + b)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
for i in a:
    if d%i==0:
        x+=d//i
    else:
        x+=(d//i)+1
print(x)

Solution (Python):












N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]

chocos = []
for i in range(N):
    chocos.append((D-1)//A[i] + 1)

ans = sum(chocos)+X

print(ans)

Solution (Python):
n = int(input())
d,x = map(int, input().split())
for i in range(n):
  x += 1 + (d - 1) // int(input())
print(x)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for i in range(n)]
ans = x
for i in a:
    ans += 1 + (d - 1) // i
print(ans)

Solution (Python):

n = int(input())
d, x = [int(s) for s in input().split()]
a = [int(input()) for _ in range(n)]

eaten = 0

for i in range(n):
    eaten += (d - 1) // a[i] + 1

print(eaten + x)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
ans = x
for _ in range(n):
    a = int(input())
    ans += int((d-1) // a )
    ans += 1
print(ans)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = []
for _ in range(N):
    A.append(int(input()))

for day in range(1, D+1):
    for person in A:
        if person == 1:
            X += 1
        else:
            if day % person == 1:
                X += 1
print(X)