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.
def main():
	n, b = map(int, input().split())
	a = list(map(int, input().split()))

	li = []
	for i in range(n - 1):
		for j in range(i + 1, n):
			if a[i] < a[j]:
				li.append([i, j])
	
	if not li:
		print(b)
	else:
		ans = []
		for el in li:
			remain = b % a[el[0]]
			keep = b // a[el[0]]
			remain += keep * a[el[1]]
			ans.append(remain)
		max(ans)

if __name__ == '__main__':
	main()