is maximal possible. Help George to cope with the task.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 1, p 2, ..., p n . You are to choose k pairs of integers:
<center class="tex-equation">[l 1, r 1], [l 2, r 2], ..., [l k , r k ] (1 ≤ l 1 ≤ r 1 < l 2 ≤ r 2 < ... < l k ≤ r k ≤ n; r i - l i + 1 = m), </center>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 p1, p2, ..., pn(0 ≤ pi ≤ 109).
Print an integer in a single line — the maximum possible value of sum.
5 2 1
1 2 3 4 5
7 1 3
2 10 7 18 5 33 0
9
61