The new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn't have enough money, so George was going to work as a programmer. Now he faced the following problem at the work.

Given a sequence of n integers p₁, p₂, ..., p_n. You are to choose k pairs of integers:

in such a way that the value of sum is maximal possible. Help George to cope with the task.

The first line contains three integers n, m and k(1 ≤ (m × k) ≤ n ≤ 5000). The second line contains n integers p₁, p₂, ..., p_n(0 ≤ p_i ≤ 10⁹).

Print an integer in a single line — the maximum possible value of sum.