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.
# @Chukamin ICPC_TRAIN

def main():
    n, b = map(int, input().split())
    data = list(map(int, input().split()))
    choose = 0
    ans = b
    for i in range(n):
        now_ans = b + (b // data[choose]) * (data[i] - data[choose])
        ans = max(ans, now_ans)
        if data[choose] > data[i]:
            choose = i
    print(ans)

if __name__ == '__main__':
    main()

   		 	 		  	      	  	 				