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):
n=int(input())
d,x=map(int,input().split())
a = [int(input()) for i in range(n)]
b = [d//a[j] if d%a[j]==0 else (d//a[j]+1) for j in range(len(a))]
print(sum(b)+x)

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

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

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())
for _ in range(N):
  n=int(input())
  if D%n:
    X+=(D//n)+1
  else:
    X+=(D//n)
print(X)

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

print(x + sum([(d-1)//a_i+1 for a_i in a]))

Solution (Python):

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

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

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

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

    
Total = X + B

print(Total)

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

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

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

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

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

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

a = [int(input()) for i in range(N)]
z = 0
sum = 0
for i in a:
    while i*z+1<=D:
        z+=1
        sum+=1
    else:
        z =0
        pass
print(sum+X)

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

Solution (Python):


def main():
    n = int(input())
    d, x = map(int, input().split())
    a = []
    for i in range(n):
        a.append(int(input()))
    cnt = 0
    
    for i in range(1, d+1):
        for j in a:
            if (i - 1) % j == 0:
                cnt += 1
    print(cnt + x)

if __name__ == '__main__':
    main()

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

su = 0
for i in a:
        c = [(j*i+1) for j in range(0,d) if (j*i+1) <= d]
        
        su = su + len(c)
print(su+x)

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

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

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

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

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

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


for i in range(N):
    A=int(input())
    day=1
    c=0
    while day<=D:
        X+=1
        c+=1
        day=c*A+1

print(X)

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

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

ans=0
for i in range(N):
    if A[i]<=D:
        ans+=(D-1)//A[i]+1
    else:
        ans+=1
print(ans+X)

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

Solution (Python):
n = int(input())
l = input().split()

d = int(l[0])
x = int(l[1])

ans = n + x

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

print(ans)

Solution (Python):
import math

N=int(input())

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

count=0

for i in range(N):
  A=int(input())
  count+=math.ceil(D/A)

print(X+count)

Solution (Python):
def main():
    n = int(input())
    d, x = [int(i) for i in input().split()]
    ax = [int(input().strip()) for i in range(n)]

    print(sum([(d + a - 1) // a for a in ax]) + x)


if __name__ == '__main__':
    main()

Solution (Python):
people = int(input())
days, remains = [int(i) for i in input().split()]
res = 0
for i in range(people):
    nth = int(input())
    d = 1
    while d <= days:
        res += 1
        d += nth
print(res + remains)

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

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

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

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

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

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

print(res+x)

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

choco = x
for i in range(n):
    a_i = int(input())
    if a_i == 1:
        choco += d
    else:
        choco += (d-1)//a_i + 1
    
print(choco)

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


def count_days(a,D):
    count = 1
    for d in range(2,D+1):
        if a*(d-1)+1 <= D:
            count+=1
    return count

print(sum([count_days(a,D) for a in A])+X)

Solution (Python):
N=int(raw_input())
D,X=map(int,raw_input().split())
A=[int(raw_input()) for i in xrange(N)]
print X+sum([(D+ai-1)/ai for ai in A])

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

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

count = X + N
for i in A:
    count += (D - 1) // i
print(count)

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

a_list = list()
for _ in range(n):
	a = input()
	a_list.append(int(a))

cookie = 0
for a in a_list:
	for i in range(1000):
		day = (a * i) + 1
		if day > d:
			break
		else:
			cookie += 1

print(cookie + x)

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

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

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

A = [int(input()) for i in range(N)]

count = 0
for i in A:
    count += 1
    tmp = i
    for n in range(1,100):
        if D >= i*n +1:
            count += 1
        else:
            break
print(count+X)

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

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

Solution (Python):
from itertools import count, takewhile

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

print(sum(sum(1 for _ in takewhile(lambda y: y<=d, count(1, a))) for a in ais) + x)

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

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

Solution (Python):
N,D,X = 0, 0, 0
A = []
Sum = 0
while True:
    N = int(input())
    a = input().split()
    D, X = int(a[0]), int(a[1])
    if (N or D or X) <1  or (N or D or X) >100:
        continue
    for i in range(N):
        a = input()
        if int(a)>=1 or int(a)<=100:
            A.append(int(a))
        else:
            continue

    for i in A:
        Sum = Sum + int(D/i) + 1
        if int(D/i) == D/i:
            Sum = Sum -1
    break
print(Sum + X)

Solution (Python):

import math

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

a = []
for i in range(N):
    a.append(int(input()))
    
for i in range(N):
    sum += math.floor((D-1)/a[i]) + 1
    
print(X + sum)

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

count = 0
for i in range(N):
	A = int(input())

	j=0
	while(j*A+1<=D):
		count += 1
		j += 1


sum_choco = count + X

print(sum_choco)

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

A=[None]*N

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

count=0
for i in range(N):
  count+=(D-1)//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()))
    
c = []

for j in a:
    cnt = 0
    b = 0
    while b*j+1 <= D:
        cnt += 1
        b += 1
    c.append(cnt)

print(sum(c) + X)

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

for j in a:
    cnt = 0
    b = 0
    while b*j+1 <= D:
        cnt += 1
        b += 1
    sum += cnt

print(X + sum)

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

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

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

sum = 0

for i in range(N):
  chocoN = 0
  for k in range(D):
    if k*A[i]+1 <= D:
      chocoN = chocoN + 1
  sum = sum + chocoN

print(sum + X)

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

A=[]

ans=N

for i in range(N):
    A.append(int(input()))

for i in range(N):
    
    for k in range(1,102):
        if A[i]*k+1<=D:
            ans+=1

ans+=X

print(ans)

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

count = 0

for i in range(A):
    count += int((D-1)/arr[i] + 1)
   
print(count + X)

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

a = [int(input()) for i in range(n)]
k = 0

for i in range(n):
    l = 1
    while l <= d:
        k += 1
        l += a[i]

print('{}'.format(k + x ))

Solution (Python):
n=int(input())
d,x = map(int, input().split(' '))
A = 0
while n > 0:
    a = int(input())
    if d % a == 0:
        A += d // a
    else:
        A += d // a + 1
    n -= 1
print(A+x)

Solution (Python):
N=int(input())
D,X = map(int,input().split())
day = D
cnt=0
for i in range(N+1):
  if i==0:
    pass
  else:
    D = day
    A=int(input())
    while D>=0:
      if D*A+1<=day:
        cnt+=1
      D-=1
print(cnt+X)

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

for a in A:
  res += (D - 1) // a + 1

print(res)

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

count = 0
for i in a_list:
  j = 0
  while i * j + 1 <=d:
    count += 1
    j += 1

print(count + x)

Solution (Python):
N = int(input())
D,X = (int(i) for i in input().split())


count = X

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

for i in range(N):
    if (A[i] == 1 or D%A[i] == 0):
        count = count + D//A[i]
    else:
        count = count + D//A[i] +1


print(count)

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

chocolate = 0
for i in range(N):
    count = 0
    for j in range(D+1):
        if j == (count * A[i] + 1):
            chocolate += 1
            count += 1
print(chocolate + X)

Solution (Python):
N = int(input())
D, X = [int(x) for x in input().split()]

def main():
    days = D - 1
    ans = X
    for _ in range(N):
        a = int(input())
        ans += (days // a) + 1
    print(ans)

if __name__ == "__main__":
    main()

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

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

print(sum([int((D - 1) / A[i]) for i in range(N)]) + X + N)

Solution (Python):
import math

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

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

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

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

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

for i in range(N):
    A.append(int(input()))

sum_list = []
for i in A:
    if (D % i) != 0:
        sum_list.append(int(D/i)+1)
    else:
        sum_list.append(int(D/i))

print(sum(sum_list)+X)

Solution (Python):
from functools import reduce
n = int(input())
d, x = [ int(i) for i in input().split(' ')]

a = [int(input()) for i in range(n)]

print( x + sum(map(lambda x: (d-1) // x + 1, a)))

Solution (Python):
member = int(input())
day,remainder = map(int,input().split())
eatrate = []
for i in range(member):
    eatrate.append(int(input()))
l = []
temp = list(range(day))
for r in eatrate:
    l.append(temp[::r])
print(sum([len(i) for i in l]) + remainder)

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(" "))

def count(j):
    k = 0
    choco = 0
    while (1 + j*k) <= d:
        choco += 1
        k += 1
    return choco

i=1
while i <= n:
    j = int(input())
    x += count(j)
    i += 1

print(x)

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

for i in range(n):

  for dy in range(100):
    day =  dy * a[i] + 1
    if day > d:
      break
    else:

      count+=1


print(count + x)

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

A = []
for _ in range(N):
    A.append(int(input()))
    
eat = 0

for i in A:
    eat += 1 + (D-1)//i

print(eat + X)

Solution (Python):
import numpy

def main():
    n = int(input())
    d, x = map(int, input().split())
    
    y = []
    for i in range(0, n):
        Ai = int(input())
        y.append(int((d-1)/Ai) + 1)

    

    arr_numpy = numpy.array(y)
    print(numpy.sum(arr_numpy) + x)

if __name__ == '__main__':
    main()

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

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

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

for ai in A:
    ans += 1
    if ai <= D:
        for j in range(1,D):
            if ai*j+1<=D:
                ans += 1
            else:
                break
print(ans+X)

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

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

for i in range(n):
    for j in range(1, d+1, a[i]):
        x += 1
    
print(x)

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

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

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

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

for i in range(n):
    a = int(input())
    if d%a==0:
        b =int(d/a)
        counter += b
    else:
        b = int(d/a)
        counter += b+1
    
print(counter+x)

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

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

for _ 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)]

for p in A:
    i = 0
    while True:
        date = 1 + p * i
        if date > D:
            break
        else:
            i += 1
            X += 1

print(X)

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

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

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

Solution (Python):
n = int(input())
n = int(n)
d, x = input().split()
d = int(d)
x = int(x)
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=[]
c=X
for i in range(N):
    a=int(input())
    c+=(D-1)//a +1
print(c)

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

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

Solution (Python):

n = int(input())
d, x = [int(s) for s in input().split()]
As = [int(input()) for _ in range(n)]
sol = sum(1 + (d-1) // a for a in As) + x
print(sol)

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

print(X)

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

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

count = 0
A = [int(input()) for i in range(N)]

for i in range(N):
    j = 0
    while j * A[i] + 1 <= D:
        j += 1
        count += 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()))
    
SUM = X
for i in range(N): SUM += ((D-1)//A[i])+1
    
print(SUM)

Solution (Python):
n = int(input())
data = input().split()
d = int(data[0])
x = int(data[1])
a = []
for i in range(n):
	a.append(int(input()))
sum = 0
for i in range(n):
	j = 1
	while j <= d:
		j += a[i]
		sum += 1	
print(sum+x)

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

count = 0

for n in range(N):
    count += (1 + (D-1) // List[n])

print(count + X)

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

tot = 0
for i in range(N):
    j = 0
    while j*A[i]+1 <= D:
        j += 1
        tot += 1
print(tot + X)

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

count = 0
for k in (A):
    for n in range(D):
        if k*n <  D:
            count +=1
print(count+X)

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

eatlist = [(D-1)//j+1 for j in A]
print(sum(eatlist)+X)

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

points = []
for i in A:
    if D%i == 0:
        point = D//i
    else:
        point = D//i + 1
    points.append(point)

print(sum(points)+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:
    day = 1
    cnt = 0
    while day <= D:
        ans += 1
        cnt += 1
        day = cnt*i+1
print(ans+X)

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

choco = x

for i in a:
    for j in range(d+1):
        chocoday = i * j + 1
        if chocoday <= d:
            choco += 1
        else:
            break
        
print(choco)

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

for A in a:
    c += int((d-1)/A)
print(c)

Solution (Python):
n=int(input())
d,x=list(map(lambda x:int(x), input().split()))
a=[int(input()) for _ in range(n)]
count=0
for mem in range(n):
    for dd in range(d):
        if dd*a[mem]+1>d:
            break
        count+=1
print(count+x)

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

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

print(X)

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


sum=0

for i in range(N):
    for j in range(101):
        tmp = j*A[i]+1

        if tmp>D:
            sum+=(j)

            break

print(X+sum)

Solution (Python):
import sys

N=int(input())

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

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

ans=X

for i in range(N):
	j=0
	while(True):
		if(j*A[i]+1>D):
			break
		ans+=1
		j+=1

print(ans)

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

for person in range(n):
    day = int(input())
    choco_for_person = (d-1)//day + 1
    all_choco += choco_for_person

print(all_choco+x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
chocolates = [X]
for i in range(N):
    A = int(input())
    chocolates.append(1)
    for j in range(1, 101):
        if j * A + 1 > D:
            break
        else:
            chocolates.append(1)
print(sum(chocolates))

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

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

Solution (Python):
import math
n = int(input())

d = input().split()
d[0] = int(d[0])
s = 0
for i in range(n):
    s = s + math.ceil(d[0]/int(input()))
print(s + int(d[1]))

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

ans = 0
for i in range(N):
    t = ((D-1) / A[i]) + 1
    ans += t
ans += X
print(ans)

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

chocolate = x

for i in a:
	chocolate += 1
	days = 1
	while(True):
		days += i
		if days <= d:
			chocolate += 1
		else:
			break

print(chocolate)

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

alist = [int(input()) for i in range(n)]

ans = x

for a in alist:
    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())
ans = 0
for _ in range(N):
  A=int(input())
  ans += (D+A-1)//A
print(ans + X)

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

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

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()


n = int(arr_data[0][0])


d = int(arr_data[1][0])


x = int(arr_data[1][1])

mysum=0
for i in range(2, 2 + n):
    
    
    a = int(arr_data[i][0])
 

    
    mysum+=1
    
    cnt=1
    

    
    while(cnt+a<=d):
        
        mysum+=1
        
        cnt+=a
 
        
mysum += x
print(mysum)

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

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

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

for i in range(N):
    if D % A[i] == 0:
        sum += int(D/A[i])
    else:
        sum += int(D/A[i])+1

print(sum+X)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
a_list = list(map(int, [input() for i in range(N)]))
counter = 0
for a in a_list:
  counter += 1
  base = 1
  for i in range(1, D):
    base = (i * a + 1)
    if base <= D:
      counter += 1
    else: 
      break
counter += X
print(counter)

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

choco = 0
for diff in a:
    n = 0
    an = 0
    while 1:
        an = 1 + diff * n
        if an > day:
            break
        choco += 1
        n += 1
print(choco + x)

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

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







for i in range(1, D):
    
    for j in range(N): 
     if(i % a[j] == 0):
        
         cnt += 1
        

cnt += X
print(cnt)

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

ans = X
for person in range(n):
    ans += 1 + (D-1) // a[person]

print(ans)

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

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

print(len([day for step in A for day in range(1, D + 1, step)]) + X)

Solution (Python):

n = int(input())

d,x = input().split()







num = 0


a = []


for i in range(n):
    a.append(int(input()))
    for j in range(int(d)):
        if a[i]*j +1 <= int(d):
            num += 1
    
    
    
    
            
print(num+int(x))

Solution (Python):
N = int(input())
D, X = input().split()
A = []
C = 0

for i in range(N):
    A.append(input())

for i in range(N):
    for j in range(100):    
        if int(A[i])*j + 1 > int(D):
            break
        else:
            C += 1

print("%d" % (C+int(X)))

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

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

print(chocolates)

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

a=[]
for i in range(n):
    a.append(int(input()))

m=[]
for i in range(n):
    if d%a[i]==0:
        m.append(int(d/a[i]))
    else:
        m.append(int(d/a[i]+1))

s=0
for i in range(n):
    s += m[i]
s += x

print(s)