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 _ in range(N)]

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

Solution (Python):


personCount = int(input())
(days, remain) = [int(i) for i in input().rstrip().split(" ")]

eatList = [int(input()) for i in range(personCount)]

eatCount = [0 for i in range(days + 1)]

for i in eatList:
    current = 1
    while(current < len(eatCount)):
        eatCount[current] += 1
        current += i

print(sum(eatCount) + remain)

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

Solution (Python):
def count(num,d):
    bite=0
    date=1
    while date<=d:
        bite+=1
        date+=num
    return bite

n=int(input()) 
d,x=map(int,input().split()) 
ans=x
for i in range(n):
    num=int(input())
    ans+=count(num,d)
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())



ans = x

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

print(ans)

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

ans = N + X
for n in range(N):
    ans += len(list(filter(lambda x: x <= D, [i*A[n] + 1for i in range(1, D+1)])))
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().strip())
D,X = map(int, input().strip().split(' '))
A = [int(input().strip()) for _ in range(N)]

ans = 0
for a in A:
  now = 1
  while True:
    if now > D: break
    ans += 1
    now += a
    
print(ans+X)

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

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


counter = 0

for i in A:
  j = i
  
  
  r = i
  y = 1
  counter +=1
  while r <= D:
    
    r = j * y + 1
    y += 1
    if r <= D:
      counter+=1




print(counter + X)

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

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

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

print(ans)

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

Solution (Python):
N = int(input())
D, X= map(int, input().split())
A = [0] * N
total = 0
for i in range(N):
  A[i] = int(input())
  total += (D-1)//A[i]+1
print(total + 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:
  day = [j*i+1 for j in range((D-1)//i+1)]
  ans += len(day)
print(ans)

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

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

sum=0
for i in range(N):
    num=0
    for j in range(N*D*2):
        if j*A[i]+1<=D:
            num+=1
        else:
            sum+=num
            break

print(sum+X)

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

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

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

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

print(chocolate)

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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

Solution (Python):
n = int(input())
d, x = map(int, input().split())
total = x
for i in range(n):
    y = int(input())
    total += 1
    for j in range(1, 100):
        current = y * j + 1
        if current <= d:
            total += 1
        else:
            break
print(total)

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

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

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

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

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

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

    print(answer)

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

Solution (Python):
count = int(input())
day,amari = map(int,input().split())
for i in range(count):
  next_day = int(input())
  day_count =1
  while day_count <= day:
    amari += 1
    day_count += next_day

    
print(amari)

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):
    ans+=int((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 = X
for i in A:
    for _ in range(1, D+1, i):
        ans += 1
print(ans)

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

count = X

for a in As:
  count += (D-1) // a + 1
  
print(count)

Solution (Python):

import sys


def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

N = II()
D, X = ISI()
A = [II() for i in range(N)]
cnt = 0
for i in range(N):
    cnt += (D-1)//A[i]+1
print(cnt+X)

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

ans = x
for ele in a:
    ans += (d - 1) // ele + 1

print(ans)

Solution (Python):
import sys
import math
from fractions import gcd





def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


N =  int(sys.stdin.readline())
D, X=  map(int, sys.stdin.readline().split())

L =  [int(sys.stdin.readline()) for _ in range(N)]

ans = X

for a in L:
    for i in range(D):
        t = a * i + 1
        if t <= D:
            ans += 1

print(ans)

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

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

ans = 0
for i in range(N):
    for j in range(D):
        if 1 + a[i] * j <= D:
            
            ans += 1
        else:
            break
print(ans + X)

Solution (Python):






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

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

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

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

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

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

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

print(x)

Solution (Python):
import sys
from statistics import *
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

n = ni()
d, x = na()
ct = 0
for i in range(n):
    a = ni()
    ct += len([1 + a * i for i in range(100) if 1 + a * i <= d])
print(ct + x)

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

c = []
for i in a:
    if d % i != 0:
        c.append(d // i + 1)
    else:
        c.append(d // i)

print(sum(c)+x)

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

for i in range(n):
  for j in range(1,101):
    tmp = j*a[i]+1
    if tmp > d:
      c += j
      break
      
      
print(c + x)

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

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

for i in range(n):
  for j in range(1,101):
    tmp = j*a[i]+1
    if tmp > d:
      lst.append(j)
      break
      
      
print(sum(lst) + x)

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

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

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

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

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

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):
def test():
    n = int(input())
    d,x = map(int,input().split())
    count = 0
    for i in range(n):
        a = int(input())
        b = [i*a+1 for i in range(d)]
        for j in range(d):
            if b[j]<=d:
                count += 1
    print(count+x)


if __name__ == "__main__":
    test()

Solution (Python):
N = int(input())
Nums = [int(e) for e in input().split()]
D = Nums[0]
X = Nums[1]
dayList = []
for i in range(N):
  dayList.append(int(input()))

totalChocolate = X
for i in range(N):
  Ai = dayList[i]
  chocolateCount = 0
  j = 0
  while Ai * j + 1 <= D:
    chocolateCount += 1
    j += 1
  totalChocolate += chocolateCount
print(totalChocolate)

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

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

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


if __name__ == "__main__":
    resolve()

Solution (Python):
N=int(input())
D,X=map(int,input().split())
ans=X
l=[]
for i in range(N):
  l.append(int(input()))
def f(n):
  ans=1
  if n>D:
    pass
  else:
    ans+=int((D-1)//n)
  return ans

for i in range(N):
  ans+=f(l[i])
    
print(ans)

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

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

Solution (Python):
N = int(input())
D, X = [int(_) for _ in input().split()]
print(sum(map(lambda x: D // x + int(D % x != 0), [int(input()) for _ in range(N)])) + X)

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

ans = 0
for _ in range(N):
    a = int(input())
    i = 0
    while i < D:
        ans += 1
        i += a

print(ans + X)

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

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(n):
  for j in range(1,d):
    if j*a[i]+1 <= d :
      cnt = cnt + 1
    
print(cnt+x)

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

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

sumsum = 0
for i in range(N):
    tmp = int(input())
    if D % tmp == 0:
        plus = D // tmp
    else:
        plus = (D // tmp) + 1

    sumsum += plus

print(sumsum+X)

Solution (Python):
def main():
    N = int(input())
    D, X = map(int, input().split())
    A = []
    for _ in range(N):
        A.append(int(input()))
    count = X
    for i in range(N):
        count += (D-1)//A[i] + 1
    return count

if __name__ == '__main__':
    print(main())

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
result = 0
for i in range(n):
    l = range(1,d+1,a[i])
    result += len(l)
print(result+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):
  ans += 1 + ((D-1)//A[i])
print (ans)

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

ans=x
for tmp in inputs:
  i=-1
  while True:
    i+=1
    day=i*tmp+1
    if day>d:
      break

    ans+=1
    
print(ans)

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

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

total = 0
for i in A:
    for j in range(1, d+1, i):
        total += 1

print(total + x)

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

x = x + n

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

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,K = map(int,input().split())
    conSumeList = [int(input()) for _ in range(N)]
    tmp = 0
    ans = 0

    for i in range(N):
        ans += 1
        tmp += conSumeList[i]
        while(True):
            if tmp+1 <= D:
                ans += 1
                tmp += conSumeList[i]
            else:
                break
        tmp = 0
    
    print(ans+K)




    


if __name__== "__main__":
    main()

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

print(sum + x)

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

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


for i in range(n):
    A=0
    count=0
    a=int(input())
    while(A*a+1<=d):
        count+=1
        A+=1
    x+=count
print(x)

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

a=[int(input()) for _ in range(n)]
sum_count=0
for i in range(n):
    A=0
    count=0
    
    while(A*a[i]+1<=d):
        count+=1
        A+=1
    sum_count+=count
print(sum_count+x)

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

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

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

print(s)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
for _ in range(n):
  a=int(input())
  day=1
  while day<=d:
    x+=1
    day+=a
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//a
    if D%a!=0:
        ans+=1
print(ans + X)

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

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a_list = [int(input()) for _ in range(n)]
count = n
for a in a_list:
    for i in range(1, 101):
        if a*i + 1 <= d:
            count += 1
        else:
            break
print(count + x)

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

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

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

ans = 0

for i in range(N):
    A = int(input())
    ans = ans + (D - 1 + A) // A

print(ans + X)

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

for _ in range(N):
  a = int(input())
  i = 0
  while i*a+1<=D:
    X+=1
    i+=1
print(X)

Solution (Python):

def choco(a,d):
    c=0 
    while c*a+1<=d: 
        c+=1
    return c 
n=int(input())
d,x=map(int,input().split())
A=[]
for i in range(n):
    A.append(int(input()))
S=0
for j in range(n):
    S+=choco(A[j],d)
print(x+S)

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

print(cnt+X)

Solution (Python):
_,d,x,*l=map(int,open(0).read().split());print(x-sum(-d//a for a in l))

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

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

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

    print(cnt)


main()

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

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

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

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

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

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

allEatChoco = 0
for i in range(0,n):
    eatChoco = 1
    for j in range(1,102):
        if a[i] * j + 1 <= days:
            eatChoco += 1
        else:
            break
    allEatChoco += eatChoco

print(allEatChoco+lastChoco)

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

for i in range(N):
    re.append(len(range(0,D,lis[i])))
print(sum(re))

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

ans = X
for a in A:
    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)]

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

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):
    ans += (d-1)//a[i]+1
ans += x
print(ans)

Solution (Python):
num = int(input())
day, remain = map(int, input().split(' '))
eat_count = 0
for i in range(0, num):
    a = int(input())

    multi = 1
    while True:
        if a > day:
            eat_count += 1
            break
        elif a * multi < day:
            eat_count += 1
        else:
            eat_count += 1
            break

        multi += 1

print(eat_count + remain)

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

count = 0


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

print(count + N + X)

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)]
cnt = 0
for i in a:
    for j in range(1, d + 1, i):
        cnt += 1
print(cnt + x)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
l = [int(input()) for _ in [0]*n]
l2 = [(d+i-1)//i for i in l]
print(x+sum(l2))

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

count = []
for i in A:
  for j in range(0,D+1):
    if i*(j)+1 <= D:
      count.append(i*(j)+1)
    
print(len(count)+X)

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

eat = 0
for _ in range(n):
    check = 1
    while check <= d:
        eat += 1
        check += a[_]
        

print(x+eat)

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):
    for j in range(1, D+1, A[i]):
        ans += 1

print(ans)

Solution (Python):
import sys
n = int(input())
d,x = map(int,input().split())
a = tuple(map(int,sys.stdin))
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):a=int(input());x+=(d-1)//a+1
print(x)

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

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

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

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

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

Solution (Python):

import itertools

n = int(input())
d, x = map(int, input().split(' '))
A = [int(input()) for i in range(n)]
S = 0

for i in range(n):
    for j in itertools.count(0):
        if j*A[i] + 1 <= d:
            S += 1
        else:
            break

print(x + S)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
count = 0
for i in range(n):
    a1 = int(input())
    count = count + (d-1)//a1 + 1
print(count+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(len(a)):
    for j in range(d):
        num = a[i] * j +1
        if num <= d:
            ans+=1
print(ans+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):
    k = 0
    count = 0
    while k*a[i]+1 <= d:
        k += 1
        count += 1
    else:
        x += count
print(x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = []
for i in range(N):
    A.append(int(input()))
count = 0
for a in A:
    i = 0
    while True:
        tmp = 1 + i * a
        if tmp <= D:
            count += 1
            i += 1
        else:
            break
print(count+X)

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

for i in range(0,N):
   Day = []
   for j in range(0,D):
       d = j*A[i] + 1
       if D >= d:
        Day.append(d)
   cnt += len(Day)


print(cnt+X)

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):
    k = 0
    while k * A[i] + 1<= D:
        k += 1
    ans += k
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 = [0] * N
for i in range(N):
    A[i] = int(input())
ans_list = []

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

ans = X + sum(ans_list)
print(ans)

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

Solution (Python):
import math

n = int(input())

d,x = list(map(int,input().split(" ")))




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

ans = x

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

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

cnt = 0

for i in li:
    s = d/i
    if s == d//i:
        cnt += d//i
    else:
        cnt += d//i + 1

    
print(cnt+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(d):
        if j * a[i] + 1 <= d:
            ans += 1
        else:
            break
print(ans)

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

eCnt = X
for i in range(N):
    tmp = int(input())
    eCnt += 1
    for i in range(tmp + 1, D + 1, tmp):
        eCnt += 1

print(eCnt)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
nums = [int(input()) for _ in range(N)]
cnt = 0
for num in nums:
  idx = 0
  while True:
    if idx * num + 1 > D:
      break
    else:
      cnt += 1
    idx += 1
print(cnt+X)

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

    x += 1
    for j in range (1, 110):
        if j * a + 1 <= d:
            x += 1
        
print(x)

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

ans = x
for i in range(n):
    a = int(input())
    ans += math.ceil(d / a)
print(ans)

Solution (Python):
a = int(input())
b, c = map(int, input().split())
d = 0
for i in range(a):
    e = int(input())
    for j in range(1, b+1, e):
        d += 1
print(d + c)

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

c = [1 + i * j for i in a for j in range(d)]

ans = 0
for i in c:
  if i <= d:
    ans += 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 A:
  ans += (D - 1) // i + 1
ans += + X
print(ans)

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

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:
    iter = 0
    date = 1
    while date <= d:
        choco += 1
        iter += 1
        date = iter * i + 1
print(choco)

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