Entrepreneur

nn, tt = [int(aa) for aa in input().split(" ")]
# def roundDownToClosest():
machi = [int(aa) for aa in input().split(" ")]
    
def func(tim):
    return (sum([tim//mach for mach in machi])-tt)

x0 = 0
for ii in range(100000):
    delta = (func(x0)-func(x0-10))/10
    if delta == 0:
        print("QUIT", func(x0)-func(x0-0.01))
        break
    x0 = x0 - (func(x0)/(delta))
    
print(round(x0))
# ii = 0
# started = [0]*nn
# produced = 0
# time = 8

# for ii in range(len(machi)):
#     produced += howManyCanProduce(ii, time)
# print(produced)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER