N, K = map(int, input().split())
A = [0] * N

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

count = 0

for i in range(N-1, -1, -1):
    if A[i] <= K:
        count += int(K/A[i])
        K = K % A[i]
        
print(count)

from queue import PriorityQueue
N = int(input())
pq = PriorityQueue()

for _ in range(N):
    date = int(input())
    pq.put(date)
    
data1 = 0
data2 = 0
sum = 0

while pq.qsize()>1:
    data1 = pq.get()
    data2 = pq.get()
    temp = data1 + data2
    sum += temp
    pq.put(temp)
    
print(sum)

from queue import PriorityQueue
N = int(input())
plusPq = PriorityQueue()
minusPq = PriorityQueue()
one = 0
zero = 0

for i in range(N):
    data = int(input())
    if data>1:
        plusPq.put(data*-1)
    elif data == 1:
        one += 1
    elif data == 0:
        zero += 1
    else:
        minusPq.put(data)
        
sum = 0

while plusPq.qsize() > 1:
    first = plusPq.get() * -1
    second = plusPq.get() * -1
    sum += first*second
    
if plusPq.qsize() > 0:
    sum += plusPq.get()*-1
    
while minusPq.qsize() > 1:
    first = minusPq.get()
    second = minusPq.get()
    sum += first * second

if minusPq.qsize() > 0:
    if zero == 0:
        sum += minusPq.get()
        
sum += one
print(sum)