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.
r=input().split()
n=int(r[0])
b=int(r[1])
a=[int(i) for i in input().split()]
c=[]
for i in a:
    if i not in c:
        c+=[i]
for i in range(len(c)):
    if c.index(min(c))==len(c)-1:
        n-=1 
        c.pop(c.index(min(c)))
b1=[]
for i in c:
    if i not in b1:
        b1+=[i]
b1=b1[b1.index(min(b1)):]
if len(b1)==1:
  print(b)
else:
  k=b%min(b1)
  k1=b//min(b1)
  result=k+(k1*max(b1))
  print(result)