One day Vasya got hold of information on the Martian dollar course in bourles for the next *n* days. The buying prices and the selling prices for one dollar on day *i* are the same and are equal to *a*<sub class="lower-index">*i*</sub>. Vasya has *b* bourles. He can buy a certain number of dollars and then sell it no more than once in *n* days. According to Martian laws, one can buy only an integer number of dollars. Which maximal sum of money in bourles can Vasya get by the end of day *n*?
The first line contains two integers *n* and *b* (1 ≤ *n*, *b* ≤ 2000) — the number of days and the initial number of money in bourles. The next line contains *n* integers *a*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 2000) — the prices of Martian dollars.
import math
n, b = map(int, input().split())
arr = list(map(int, input().split()))
mm = max(arr)
ans = b
ans2 = [0]
f = 1
for i in arr:
    if f == 1:
        if i < mm:
            temp2 = i
            temp = math.floor(b/i)
            b -= i*temp
            f = 0
    if f == 0:
        if i > temp2:
            b += i*temp
            ans2.append(b)
            f = 1

print(max(ans, max(ans2)))
