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:

$[*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*),$

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

Input

The first line contains three integers $*n*$, $*m*$ and $*k*$ $(1 ≤ (*m* × *k*) ≤ *n* ≤ 5000)$. The second line contains $*n*$ integers $*p*_{1}, *p*_{2}, ..., *p*_{*n*}$ $(0 ≤ *p*_{*i*} ≤ 10^{9})$.

Output

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