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

n_days, mon = tuple([int(x) for x in sys.stdin.readline().split()])
values = [int(x) for x in sys.stdin.readline().split()]

best_score = -100000000000000
best_pair = 0

for i in range(len(values)):
    for j in range(0, i):
        a, b = values[i], values[j]

        if b <= mon:
            if a - b > best_score:
                best_score = a - b
                best_pair = (a, b)

if best_score > 0:
    dollar_gain = mon // best_pair[1]
    bourles_loss = dollar_gain * best_pair[1]
    result = mon - bourles_loss + dollar_gain * best_pair[0]
    print(result)
else:
    print(mon)
