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]))
# print(tt)
def run():
    mi = 0
    ma = 1
    while (aa:=func(ma)) < tt:
        if aa == tt:
            return tt
        mi = ma
        ma *= 2
    # print(mi, func(mi), ma, func(ma))
    mid = (mi+ma)//2
    while (aa:=func(mid)) != tt:
        # print(f"mi: {mi}, f(mi): {func(mi)}, mid: {mid}, f(mid): {func(mid)}, ma: {ma}, f(ma): {func(ma)}")
        # if func(mi) == tt:
        #     return mi
        # if func(ma) == tt:
        #     return ma
        if ma-mi == 1:
            return ma
        if aa <= tt:
            mi = mid
        else:
            ma = mid
        mid = (mi+ma)//2
        # return

    return mid
print(run())

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED