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 sys
input = sys.stdin.readline

def get_min(r):
    mins = sorted(r, reverse=True)[2:] if len(r)%2==0 else sorted(r, reverse=True)[3:]
    maxs = []
    for i in mins:
        if r.index(i) == len(r)//2-1:
            maxs.append((r[r.index(i)], r[r.index(i)+1]))
    return max(maxs) if maxs else None

for _ in range(1):
    n, b = map(int, input().split())
    a = [int(x) for x in input().split()]
    mins = get_min(a)
    if mins:
        mars = b // mins[0]; b = b % mins[0]
        b += mars * mins[1]
    print(b)