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, k = map(int, input().split())
t = list(map(int, input().split()))
a = [t[0]] + [0] * (n - 1)
for i in range(n - 1): a[i + 1] = min(a[i], t[i + 1])
t.reverse()
b = [t[0]] + [0] * (n - 1)
for i in range(n - 1): b[i + 1] = max(b[i], t[i + 1])
b.reverse()
print(k + max((k // a[i]) * (b[i] - a[i]) for i in range(n)))