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 check(a):
        l = len(a)
        m = 0.0
        tem1 = 0
        tem2 = 0
        for i in range(l):
            for j in range(i, l):
                if a[j]/a[i] > m:
                    m = a[j]/a[i]
                    tem1 = i
                    tem2 = j
        return tem1,tem2

def cal(d, t, g):
    a, b = check(g)

    num = int(t/g[a])
    res = t%g[a]
    sal = num*g[b] + res
    return sal
x = input().split(" ")
y = input().split(" ")
d = int(x[0])
t = int(x[1])
g = [int(i) for i in y]
print(cal(d, t, g))