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


Output

Print the maximum possible total score for Takahashi's throws.

Examples

Input

5 2 3
10 2 8 10 2


Output

56


Input

5 5 2
5 2 10 5 9


Output

28


Input

10 3 5
3 7 2 6 9 4 8 5 1 1000000000


Output

5000000078
// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int dp[301][100001];
 
signed main() {
    int N, M, K; cin >> N >> M >> K;
    vector<int> A(N);
    for(int i=0; i<N; i++) {
        cin >> A[i];
        dp[1][i] = A[i];
    }

    for(int k=1; k<K; k++) {
        deque< pair<int, int> > deq;
        deq.push_back(make_pair(0, -1));
        for(int i=k-1; i<N; i++) {
            // dp[k-1][i-1] から dp[k-1][i-M] までを見る
            int num = k + 1;
            
            int prev_max = deq.front().first;
            dp[k+1][i] = prev_max + A[i] * num;
            // printf("dp[%lld][%lld], assign = %lld\n", k+1, i+1, prev_max);

            int lb = i-M+1, val = dp[k][i];
            while(deq.size() && deq.back().first <= val) deq.pop_back();

            pair<int, int> elem = make_pair(val, i);
            deq.push_back(elem);
            while(deq.size() && deq.front().second < lb) deq.pop_front();
        }
    }
    cout << *max_element(dp[K], dp[K]+N) << endl;
    return 0;
}