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,b=map(int,input().split())
l=list(map(int,input().split()))
r=sorted(l)
r.reverse()
p=[]
#print(r,l)
if l==r:
    print(b)
else:
    for i in range(1,n):
        mi=min(l[0:i])
        j=l.index(mi)
        ma=max(l[j:i+1])
        p.append((ma*(b//mi))+(b%mi))
    print(max(p))