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

n, b = map(int, input().split())
w = list(map(int, input().split()))

if n == 1:
    print(b)
    exit(0)


x = -1
i, q = 1, w[0]
while i < n:
    while w[i] < q:
        q = w[i]
        i += 1
        if i == n:
            break

    if i == n:
        break

    d = q
    while w[i] > d:
        d = w[i]
        i += 1
        if i == n:
            break
    b = b//q * w[i-1] + b%q
    if i == n:
        break
    q = w[i]
    i += 1

print(b)