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,p=map(int,input().split())
l=list(map(int,input().split()))
m=0
oldp=p
for i in range(n-1):
    for j in range(i+1,n):
        
        if l[i]<=p and l[j]>l[i]:
            dollars=0
            p=oldp
            dollars=p//l[i]
            p-=dollars*l[i]
            p+=dollars*l[j]
            if p>m:
                m=p
if m==0:
    print(p)
    exit()
print(m)