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, am=map(int, input().split())
a=list(map(int, input().split()))
maxd=0
x=0
y=0
profit=0
b=[0]*n
b[n-1]=-1
maxi=0
for i in range(n-2, -1, -1):
    maxi = max(maxi, a[i+1])    
    b[i] = maxi
for i in range(n):
    if b[i]>0:        
        profit=max(profit, (am//a[i])*(b[i]-a[i]))
print(am+profit)
 	 		    	 	 		 	  					   	 		