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.
init_money = int(input().split()[1])
prices = [int(k) for k in input().split()]

n = len(prices)

buy_price = prices[0]
sell_price = prices[0]
for idx, i in enumerate(prices):
    if i <= buy_price and any([k > i for k in prices[idx:]]):
        buy_price = i
        sell_price = max(prices[idx:])

if buy_price == sell_price:
    print(init_money)
else:
    buy_dollar = init_money // buy_price
    sell_profit = buy_dollar * sell_price

    profit = sell_profit - (buy_dollar * buy_price)

    print(profit + init_money)