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.
n, b = map(int, input().split())
a = list(map(int, input().split()))
d = 0
b1 = 0
if a != sorted(a, reverse=True):
    if a[0] == max(a) or a[-1] == min(a):
        while a[0] == max(a) or a[-1] == min(a):
            for j in range(len(a)):
                if a[j] < a[j+1] and a[0] == j:
                    a.remove(j)
                if a[j] == min(a) and a[-1] == j:
                    a.remove(j)
    for i in a:
        if i == min(a):
            d = round(b / i - 0.49)
            b1 = b - d * i
            a = a[a.index((i)):]
        if i == max(a):
            b = d * i + b1
    print(b)
else:
    print(b)
