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.
m , n = map(int , input().split())
l = list(map(int , input().split())) 
buy = 2000000
idx= 0 
if sorted(l , reverse= True ) == l :
    profit = n % l[-1]  + ((n //l[-1]) * l[-1])
    print(profit) 
else:   
    for i in range(0 , m-1 ) : 
        if buy > l[i] :
            buy = min(buy , l[i])
            idx = i 
    sell = max(l[idx : ])
    profit = n % buy + ((n // buy) * sell)
    print(profit)


