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,m=map(int,input().split())
a=list(map(int,input().split()))
ans=0
x=a[0]
y=a[0]
c=True
for i in range(1,n):
    if(a[i]<x):
        l=m%x
        s=m//x
        # print(ans,x,y)
        ans=max(ans,s*y+l)
        x=a[i]
        y=a[i]
        if(i==n-1):
            c=False
    else:
        if(a[i]>y):
            y=a[i]
# print(ans)   
if(c):
    l=m%x
    s=m//x
    ans=max(ans,s*y+l)        
print(ans)        