CF41B.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?

一天，瓦西娅获得了未来 $n$ 天内火星美元兑布尔勒斯（bourles）的汇率信息。第 $i$ 天买入与卖出 1 美元的价格相同，均为 $a_i$。瓦西娅当前拥有 $b$ 布尔勒斯。他可以买入一定数量的美元，并且在 $n$ 天内最多只能卖出一次。根据火星法律，美元只能以整数单位购买。问：到第 $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.

第一行包含两个整数 $n$ 和 $b$（$1 \leq n, b \leq 2000$）——分别表示天数和初始的布尔币金额。
下一行包含 $n$ 个整数 $a_i$（$1 \leq a_i \leq 2000$）——表示火星美元的价格。

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

输出唯一的数字——即瓦西娅在第 $n$ 天结束时所能获得的最大金额（单位：布尔列）。