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 = input()
prices = input()
min_buy = prices[0]
max_sell = prices[-1]
for i in range(n):
    left = i
    right = n - 1 - i
    if prices[left] < min_buy:
        min_buy = prices[left]
    if prices[right] > max_sell:
        max_sell = prices[right]
    if left >= right:
        break
print(b + b//min_buy * (max_sell - min_buy))
