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):
def eat(a,day):
    count = 0
    i = 0
    while(True):
        if i == 0:
            count = count + 1
        elif i*a +1 <= day:
            count = count + 1
        else:
            break
        i = i + 1
    return count

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

eatcounts = 0
for i in range(N):
    eatcounts = eatcounts + eat(A[i],dn[0])

eatcounts = eatcounts + dn[1]
print(eatcounts)

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

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

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

Solution (Python):

people = int(input())
day,left = map(int,input().split())

interval = [int(input()) for i in range(people)]
ans = left

for i in range(people):
	ans += (day-1)//interval[i] + 1
	
print(ans)

Solution (Python):
def main():
    N = int(input())
    D, X = map(int, input().split())
    A = tuple(int(input()) for _ in [0] * N)

    choco = 0
    for i in A:
        j = 0
        n = 0
        while 1:
            n = i * j + 1
            j += 1
            if n > D:
                break
            choco += 1
    print(choco + X)

main()

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

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

Solution (Python):
import numpy

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

num = 0
for i in range(N):
 num=num+numpy.ceil(D/float(a[i]))

print int(num)+X

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

sum = 0
for j in a:
  sum += (D-1)//j
print(X + N + sum)

Solution (Python):


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



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



print(X + sum(choco_eaten))

Solution (Python):
if __name__ == '__main__':
    N = int(input())
    D,X = map(int,input().split())
    A_L = [int(input()) for i in range(N)]
    eat_L = [int((D-1)/A_L[k])+1 for k in range(N)]
    
    print(sum(eat_L)+X)

Solution (Python):


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

i=0
for line in sys.stdin:
     x += (d-1) // (int(line)) +1 

print("{}".format(x))

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

def f(a):
    return (D-1)//a + 1

sums = sum(list(map(f, A)))
print(sums + X)

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

for n in range(N):
    a = int(input())
    X += D//a + 1

print(X)

Solution (Python):


import numpy as np

N = int(input())
D =input().split()
X = int(D[1])
D = int(D[0])

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

for a in A:
    for i in range(D):
        if i*a + 1 <= D:
            suml += 1
        else:
            break
print(suml+X)

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

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

count = x

for i in range(n):
    j = 0
    while d >= j * a[i] + 1:
        count += 1
        j += 1


print(count)

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

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

print(ans+X)

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

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

    print(total)

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

count = 0
for Ai in A:
    temp = D // Ai
    if D % Ai == 0:
        count += temp
    else:
        count += 1 + temp

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

Solution (Python):



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



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

print(t+X)

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

Solution (Python):
n=int(input())
x=input()
x=x.split()
d=int(x[0])
x=int(x[1])
o=0
for i in range(n):
  a=int(input())
  b=0
  c=0
  while (c*a+1)<=d:
    o+=1
    c+=1
    
o+=x
print(str(o))

Solution (Python):
n = int(input())
d, pieces = map(int, input().split())
a = [int(input()) for _ in range(n)]
for ai in a:
    j = 1
    pieces += 1
    while (j * ai) + 1 <= d:
        pieces += 1
        j += 1
print(pieces)

Solution (Python):


N = int(raw_input())

tmp = map(int, raw_input().split())
D = tmp[0]
X = tmp[1]

total = 0
for i in range(N):
    current = int(raw_input())
    each = (D - 1) / current
    each += 1
    total += each
    
print (total + X)

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

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

def choco(t):
    k=0
    while(1):
        s=k*t+1
        if s>d: break
        k+=1
    return k

T=[]
for i in A:
    T.append(choco(i))

print(sum(T)+x)

Solution (Python):
num = int(input())

tmp = input().split()

day = tmp[0]

last = tmp[1]

total = int(last)

for i in range(num):
    now = 1

    up = int(input())
    
    while now <= int(day):
        total += 1
        now += up

print(total)

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

Solution (Python):




def get_input():
    while True:
        try:
            yield input()
        except EOFError:
            break

N = int(input())
D, X = map(int, input().split(' '))
A = list(map(int, get_input()))
Y = X

for A_i in A:
    n = 0
    while n * A_i + 1 <= D:
        Y += 1
        n += 1

print(Y)

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

Solution (Python):
N = int(input())
LST = input().split(" ")
D = int(LST[0])
X = int(LST[1])

a = 0
a += X
if D != 0:
    a += N

for i in range(N):
    d = int(input())
    a += int(D/d)
    if D%d ==0:
        a -= 1
        
print(a)

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

A = [int(input()) for i in range(n)]
ans = 0

for a in A:
    cnt = 0
    c = 0
    while c <= d:
        cnt += 1
        c = cnt*a+1
        ans += 1
    
    
ans += x

print(ans)

Solution (Python):


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

    c = 0
    for _ in range(n):
        a = int(input())
        for b in range(0,100):
            if a * b + 1 <= d:
                c += 1
            else:
                break

    print(c + x)

if __name__ == '__main__':
    main()

Solution (Python):


def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

n, = read_line(int)
d, x = read_line(int, int)

a = []
for i in range(n):
    ai, = read_line(int)
    a.append(ai)


sum = 0
for ai in a:
    sum += len(range(0, d, ai))

print(sum + x)

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

ary_A=[]

for i in range(N):
    ary_A.append(int(raw_input()))



eaten=[]

for i in range(N):
    eaten.append(0)
    day=1
    while(1):
        if day <= D:
            eaten[i] += 1
            day += ary_A[i]
            continue
        else:
            break


print sum(eaten) + X

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

for i in range(n):
    ai = int(input())
    c = 1
    ans += 1
    while d >= c * ai + 1:
        ans += 1
        c += 1
print(ans+x)

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

    a += n_tmp
print(a+X)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
A=[]
for I in range(N):
	A.append(int(input()))
SUM=sum(A)
ANS=0
for K in range(N):
	W=0
	E=1
	while(E<=D):
		W+=1
		E=1+W*A[K]
		ANS+=1
print(ANS+X)

Solution (Python):
import sys

with sys.stdin as f:
    s_input = f.read()

    s_args = s_input.splitlines()
    n = int(s_args[0])
    dx = s_args[1].split()
    d = int(dx[0])
    x = int(dx[1])
    an = [int(sa) for sa in s_args[2:]]

    res = x
    for ai in an:
        res += (d-1) // ai + 1

    print(res)
        
sys.exit(0)

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

Solution (Python):
if __name__ == "__main__":
    N = int(input())
    D, X = list(map(int, (input().split(' '))))
    A = []
    for i in range(N):
        A.append(int(input()))
    snack_num = X
    for i in range(N):
        if A[i] == 1:
            snack_num += D
        elif D % A[i] == 0:
            snack_num += (D // A[i])
        else:
            snack_num += (D // A[i] + 1)
    print(snack_num)

Solution (Python):

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

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

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

Solution (Python):
import numpy as np

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

res = np.zeros(N)

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

print(int(np.sum(res)+X))

Solution (Python):
import sys

stdin = sys.stdin

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

n = ni()
d,x = na()
a = []
for i in range(n):
    a.append(ni())

s = [1]*n
for i in range(n):
    for j in range(1,101):
        if a[i]*j + 1 <= d:
            s[i] += 1
        else:
            break
print(sum(s) + x)

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

for _ in xrange(n):
    ai = int(raw_input().strip())
    multi = 0
    while multi * ai + 1 <= d:
        x += 1
        multi += 1

print x

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

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

print(int(x))

Solution (Python):
import math
import numpy as np
from operator import mul





























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

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

print(X)

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

print(count+x)

Solution (Python):


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

choco = X

for i in A:
    if D % i == 0: 
        choco = choco + int(D/i) - 1 + 1
    else:
        choco = choco + int(D/i) + 1

print(choco)

Solution (Python):

import math
def how_many_choco(A, D):
    """ 何個チョコ食ったか返す
    nA + 1 <= Dを満たすnを求める
    """
    return math.floor((D-1)/A) + 1

if __name__ == "__main__":
    N = int(input())
    D, X = list(map(int, input().split()))
    eaten = 0
    for i in range(N):
        A = int(input())
        eaten += how_many_choco(A, D)
    print(X + eaten)

Solution (Python):
import math

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


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

d = float(d)
res = x

for i in range(n):
    res += math.ceil(d / a[i])

print(res)

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

Solution (Python):





if __name__ == '__main__':
    person_count = int(input())
    duration, x = map(int, input().split())
    a = [int(input()) for _ in range(person_count)]

    count = 0

    for i in a:
        y = 0

        while i * y + 1 <= duration:
            count += 1
            y += 1

    print(count + x)

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

sum = x
for a in array:
    j = 0
    while 1 + j * a <= d:
        sum += 1
        j += 1

print(sum)

Solution (Python):
import sys

N = int(input())

Tmp = []
Tmp = input().rstrip().split(' ')

D = int(Tmp[0])
X = int(Tmp[1])


Ans = 0
if D == 1:
    Ans = N + X
    print(Ans)
    sys.exit()

Count = 0
for i in range(N):
    K = int(input())
    TmpN = 1
    Flag = 0
    while Flag==0:
        TmpNum = K * (TmpN - 1) + 1
        if TmpNum > D:
            Flag = 1
            break
        else:
            Count += 1
        
        TmpN += 1

Ans = Count + X
print(Ans)

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

choco=[]
for i in range(N):
    choco.append((D-1)//A[i]+1)
print(sum(choco)+X)

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

chocos = dx[1]

for i in range(n):
    a = int(input())
    chocos += -(-dx[0] // a )
    
print(chocos)

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

cnt = 0
for _ in range(n):
    a = int(input())
    i = 1
    while i <= d:
        cnt += 1
        i += a

print(x + cnt)

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

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

s = x

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

print(s)

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

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

total_days = []

for x in day_list:

    m = int((D-1)//x)
    m += 1

    total_days.append(m)

total_choco = sum(total_days) + X
print(total_choco)

Solution (Python):
def main():
    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)


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
s = input().split(" ")
D = int(s[0])
X = int(s[1])
cnt = X
for i in range(N):
    s = int(input())
    n = int((D-1) / s) + 1
    cnt += n
print(cnt)

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

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

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

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

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


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

Solution (Python):
n = input()
(d, x), c = map(int, raw_input().split()), 0
for i in xrange(n):
    c += len(range(1, d + 1, input()))
print c + x

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

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

    print(X + eat)

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

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

counter = X;
diff = D-1;

for i in range(N):
	counter += diff//ai[i] + 1

print (counter);

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

s = 0
for a in A:
    for x in range(100+1):
        if a * x + 1 <= D:
            continue
        s += x
        break

print(s + X)

Solution (Python):
import numpy as np

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

a = np.zeros(n, np.int)
for i in range(n):
    a[i] = int(input())

for i in a:
    k = 1
    while(k <= d):
        x += 1
        k += i

print(x)

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

s = 0
for i in a:
    for j in range(1, d+1, i):
        s += 1
print(s+x)

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

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

Solution (Python):
a = int(input())
b= input().split()
b,c = int(b[0]),int(b[1])
ii = []
for i in range(a):
    ii.append(int(input()))
sumcho = 0
for i in ii:
    sumcho += ((b-1) // i)+1 
print(sumcho+c)

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

for i in range(N):
    a = int(input())
    X += D // a
    if D % a != 0:
        X += 1
print(X)

Solution (Python):

import sys

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    N = int(read_func().strip().split()[0])
    input_raw = read_func().strip().split()
    [D, X] = [int(input_raw[0]), int(input_raw[1])]
    s = 0
    for i in range(N):
        input_raw = read_func().strip().split()
        A = int(input_raw[0])
        s += (D - 1)/A + 1

    print s + X

if __name__ == '__main__':
    main()

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

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

ate = 0

for i,choc in enumerate(a):
    for j in range(d):
        if j%choc==0:
            ate+=1

print(ate+x)

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

Solution (Python):
import math

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

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

result = 0
for i in range(N):
    result += math.floor((D-1)/A[i]+1)

print(result+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())
total = 0

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

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

print(total + x)

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

result = x

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

print(result)

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

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

a = []

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

total = 0

for i in range(n):

    for j in range(d):
        if j % a[i] == 0:
            total += 1

total += x
print(total)

Solution (Python):
import math
N = int(input())
D, X = [int(i) for i in input().split()]
for i in range(N):
	X += math.ceil(D/int(input()))
print(X)

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

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

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

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

Solution (Python):

"""
B - Chocolate
https://beta.atcoder.jp/contests/abc092/tasks/abc092_b

"""
import sys
from sys import stdin
input = stdin.readline


def solve(N, D, X, A):
    ans = X
    for a in A:
        for i in range(1, D+1, a):
            ans += 1
    return ans


def main(args):
    N = int(input())
    D, X = map(int, input().split())
    A = []
    for _ in range(N):
        A.append(int(input()))
    ans = solve(N, D, X, A)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

res = 0
for count in range(n):
    tmp = int(input())
    for i in range(1, d+1, tmp):
        res += 1

print(res+x)

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

def solve(a,x):
  res=0
  cnt=0
  while cnt*a+1<=x:
    res+=1
    cnt+=1
  return res

ans=0
for i in range(N):
  ans+=solve(A[i],D)

print(ans+X)

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

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())
cand = []
total = 0
for i in range(N):
    cand.append(int(input()))
for j in range(N):
    total += 1 + (D-1)//cand[j]
print(total+X)

Solution (Python):
n = input()
d, x = map(int, raw_input().split())
s = x
for _ in xrange(n):
    i = 1
    a = input()
    j = 1
    while(i <= d):
        s += 1
        i = j*a + 1
        j += 1
print s

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

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

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

print(ans)

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

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

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

print(ans)

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())
for i in range (0,N):
	a = int(input())
	j = 1
	while j <= D :
		j += a
		X += 1
print(X)

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

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

result = X

for ai in A:
    result += 1 + (D - 1) // ai

print(result)

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

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

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

pre = len(A)
for a in A:
    pre += int((D-1)/a)

print(pre+X)

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

print(num+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):
    tot=1
    while True:
        if tot>d: break
        tot+=a[i]
        ans+=1
print(ans)

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

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

print(Z+X)

Solution (Python):
import math

N = int(input())
D, X = map(int, input().split())
count = X
for n in range(N):
    a = int(input())
    count += math.ceil(D/a)
print(count)

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

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

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

print(sum+x)

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

Solution (Python):
import sys

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

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

Solution (Python):
N = int(input())
input_array = list(map(int,input().split()))
day = input_array[0]
left = input_array[1]
out = 0
out += left

for i in range(N):
    temp = int(input())
    out += (1+int((day-1)/temp))


print(out)

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

sum = X
for _ in range(N):
    A = int(input())
    for _ in range(0, D, A):
        sum += 1
print(sum)

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

Solution (Python):
import math

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

ans = 0
for a in A:
    ans += math.ceil(D / a)
print(ans + X)

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

print(x + num)

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

Solution (Python):


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

def eat(d, ai):
    res = 0
    for j in range(d):
        if j % ai == 0:
            res += 1
    return res

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

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

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

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

r = 0

for i in range(1, D + 1):
    for j in A:
        if i % j == 1 or j == 1:
            r += 1

print(r + X)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
cou = 0
for i in range(n):
    a = int(input())
    for k in range(d):
        if k % a == 0:
            cou += 1
print(cou+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)