There are $N$ panels arranged in a row in Takahashi's house, numbered $1$ through $N$. The $i$\-th panel has a number $A_i$ written on it. Takahashi is playing by throwing balls at these panels.
Takahashi threw a ball $K$ times. Let the panel hit by a boll in the $i$\-th throw be panel $p_i$. He set the score for the $i$\-th throw as $i \times A_{p_i}$.
He was about to calculate the total score for his throws, when he realized that he forgot the panels hit by balls, $p_1,p_2,...,p_K$. The only fact he remembers is that for every $i$ $(1 ≦ i ≦ K-1)$, $1 ≦ p_{i+1}-p_i ≦ M$ holds. Based on this fact, find the maximum possible total score for his throws.
## Constraints
* $1 ≦ M ≦ N ≦ 100,000$
* $1 ≦ K ≦ min(300,N)$
* $1 ≦ A_i ≦ 10^{9}$
## Input
The input is given from Standard Input in the following format:
$N$ $M$ $K$
$A_1$ $A_2$ … $A_N$
## Partial Scores
* In the test set worth $100$ points, $M = N$.
* In the test set worth another $200$ points, $N ≦ 300$ and $K ≦ 30$.
* In the test set worth another $300$ points, $K ≦ 30$.
[samples]