Honey

Fluffy is a squirrel who likes honey very much. He lives on a tall, big tree and collects honey from the $N$ beehives on that tree.

One day he notices that every bee has gone out to work. Collecting the honey is safe now, so he decides to do it. The only thing he can carry honey in is one honey pot that holds $M$ ml. On each trip he picks one beehive and takes as much of the honey left in it as the pot holds, so a single trip yields the smaller of $M$ and the amount still in that hive. He may pick the same hive on several trips. Fluffy is a lazy squirrel, so he decides not to collect honey more than $K$ times.

Fluffy reads the amount of honey $m_i$ ml in hive $i$ exactly by looking at it. Compute the largest total amount of honey he can collect.

The first line has three positive integers $N$, $M$ and $K$, separated by spaces. ($N \le 200{,}000$, $K \le 2{,}000{,}000{,}000$, $M \le 500{,}000$)

Each of the next $N$ lines has one positive integer $m_i$. ($m_i \le 500{,}000$)

Print a single integer, the largest amount of honey Fluffy can collect.