Klocki

Bajtek has a great many blocks, and he loves playing with them. Unfortunately he has only one box for them, and it is so small that not all of the blocks fit inside.

Bajtek is a very tidy boy and does not like leaving a mess in his room, so after playing he always packs the blocks into the box and puts the box on a shelf.

All blocks are the same size, so no matter which ones he picks he can fit at most $k$ blocks into the box. As far as possible he would like to leave only the light blocks on the floor, so he always tries to pack the heavier ones. Sometimes, though, the box turns out to be too heavy for him to lift onto the shelf, because Bajtek is only a little boy. He therefore tries to pack the blocks so that their total mass is as large as possible while still being light enough for him to lift.

Bajtek is tired of repacking the blocks just because he is not strong enough to lift the box. Write a program that tells him how to pack the blocks optimally.

The first line contains three integers $n$, $k$, and $s$ ($k \le n \le 30$, $1 \le k \le 12$, $1 \le s \le 10^6$), separated by single spaces. They denote the total number of blocks, the maximum number of blocks that fit in the box, and Bajtek's strength (the maximum mass of a box he can lift), respectively.

The second line contains $n$ integers $m_i$ ($1 \le m_i \le 10^6$), separated by single spaces, denoting the masses of the individual blocks.

The mass of the box itself is ignored (you may assume it is $0$).

Print a single integer $M$: the maximum mass of a box loaded with blocks that Bajtek can lift.

An empty box has mass $0$, which Bajtek can always lift, so the answer is never less than $0$. For example, when $s = 5$, at most $2$ blocks may be packed, and the block masses are $1, 3, 6$, the best choice is to pack the blocks of mass $1$ and $3$ for a total of $4$. The block of mass $6$ already exceeds $5$ on its own, and combinations such as $1+6$ or $3+6$ also exceed $5$.