A7904. Martian Dollar

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_{i}$ . 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_{i}$ ( $1<=a_{i}<=2000$ ) — the prices of Martian dollars.

Print the single number — which maximal sum of money in bourles can Vasya get by the end of day $n$ .