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.
def maxElemFrom(cont, fromInd):
    ans = cont[fromInd]
    for i in range(fromInd + 1, len(cont)):
        if ans < cont[i]:
            ans = cont[i]
    return ans


n, rub = [int(item) for item in input().split(' ')]
cont = [int(item) for item in input().split(' ')]
ans = rub
for i in range(n - 1):
    dollars = rub // cont[i]
    rem = rub % cont[i]
    cust_max = maxElemFrom(cont, i + 1)
    temp = dollars * cust_max + rem
    if ans < temp:
        ans = temp
print(ans)
