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
from collections import defaultdict,deque
def I(): return int(input())
def II(): return list(map(int, input().split()))
def S(): return input()[:-1]
def M(n): return [list(map(int, input().split())) for ___ in range(n)]
def pb(b): print('YES' if b else 'NO')
def INF(): return float('inf')
# -----------------------------------------------------------------------------------------------------
#
# 　　　　　　　　　　　 ∧＿∧
# 　　　　　 ∧＿∧ 　 （´<_｀ ）　     Welcome to My Coding Space !
# 　　　　 （ ´_ゝ`）　/　 ⌒i        Free Hong Kong !
# 　　　　／　　　＼　 　  |　|       Free Tibet !
# 　　　 /　　 /￣￣￣￣/　|　 |
# 　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
# 　 　　　＼/＿＿＿＿/　（u　⊃
#
#     再帰関数ですか？　SYS!!!!
#     BINARY SEARCH ?
# -----------------------------------------------------------------------------------------------------
n,b = II()
a = II()
for i in range(n-1):
    if a[i] < a[i+1]:
        b = b%a[i] + (b//a[i])*a[i+1]
print(b)