A11520 | Party Lemonade

A New Year party is not a New Year party without lemonade! As usual, you are expecting a lot of guests, and buying lemonade has already become a pleasant necessity.

Your favorite store sells lemonade in bottles of $n$ different volumes at different costs. A single bottle of type $i$ has volume $2^{i-1}$ liters and costs $c_{i}$ roubles. The number of bottles of each type in the store can be considered infinite.

You want to buy at least $L$ liters of lemonade. How many roubles do you have to spend?

The first line contains two integers $n$ and $L$ ( $1<=n<=30$ ; $1<=L<=10^{9}$ ) — the number of types of bottles in the store and the required amount of lemonade in liters, respectively.

The second line contains $n$ integers $c_{1},c_{2},...,c_{n}$ ( $1<=c_{i}<=10^{9}$ ) — the costs of bottles of different types.

Output a single integer — the smallest number of roubles you have to pay in order to buy at least $L$ liters of lemonade.