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.
def cal(b,l,h): return(b//l * h + b%l)

(n,b) = map(int,str.split(input()))
a = list(map(int,str.split(input())))
(l,h,tl,th) = (a[0],a[0],a[0],a[0])
for x in a:
	if x < tl: (tl , th) = (x,x)
	if x > th: 
		th = x
		if cal(b,tl,th) > cal(b,l,h): (h,l) = (th, tl)
if cal(b,tl,th) > cal(b,l,h): (h,l) = (th, tl)
print(cal(b,l,h))
