시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 2 2 2 100.000%

## 문제

After moving to Taipei, Dreamoon always goes to dinner at Jinmei Night Market. There are $N$ kinds of food sold at Jinmei Night Market. These foods are numbered from $1$ to $N$. The price of one piece of $i$-th food is $p_i$.

Every night, Dreamoon will choose a non-empty set of foods and eat one piece of each food in this set. Dreamoon likes new things. So he won't choose the same set in two different nights. Besides this, because Dreamoon is a poor boy, each night, he will choose the cheapest food set that he didn't choose before.

Now, you are given a positive integer $K$. Can you tell Dreamoon which set of foods he will choose on $K$-th day? You only have to tell him how much he will spent on this day.

## 입력

The input consists of two lines. The first line contains an integer $N$. The second line consists of $N$ integers $p_1, p_2, \ldots, p_N$.

## 출력

Output one number indicating how much Dreamoon will spend on food on $K$-th day.

## 제한

• $2 \le N \le 2 \times 10^5$
• $1 \le K \le \min(10^6, 2^N - 1)$
• $1 \le p_i \le 10^8$

## 예제 입력 1

5 30
4 2 1 16 8


## 예제 출력 1

30


## 예제 입력 2

4 5
1 1 2 2


## 예제 출력 2

2