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.
# Don't wait for opportunity. Create it. Unknown
# by : Blue Edge - Create some chaos
n,b=map(int,input().split())
a=list(map(int,input().split()))
c=[]
mini=4000
for x in a[:-1]:
    mini=min(x,mini)
    c.append(mini)

maxi=0
i=n-2
ans=b
for x in a[-1:0:-1]:
    maxi=max(maxi,x)
    # print(maxi,c[i])
    ans=max(ans,b+max(0,(b//c[i])*(maxi-c[i])))
    # print(ans)
    i-=1

print(ans)
