Problem: 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

Solution (in CPP):

Solution:
// aribon4-4_b
// CODE FESTIVAL 2016 Tournament Round 3 A ストラックアウト
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()

#define INF ((1 << 29)-1)
#define MOD (1000000007)

#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int i=0;i<(n-1);i++) cout << (vec)[i] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << endl;}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;

ll dp[333][100005];

int main() {
#ifdef LOCAL
    ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif

    int N, M, K;
    cin >> N >> M >> K;
    vector<ll> A(N);
    REP(i, N) cin >> A[i];

    //vector<vector<ll>> dp(K+1, vector<ll>(N, -1));
    //dp[0].assign(N, 0);
  	memset(dp, -1, sizeof(dp));
  	REP(i, N) dp[0][i] = 0;

    vector<deque<ll>> deqs(K+1);
    deqs[0].emplace_back(0);

    REP(i, N){

        REPN_REV(k, 1, K+1) {

            if (deqs[k-1].empty()) continue;

            // スライド最大値
            dp[k][i] = dp[k-1][deqs[k-1].front()] + k * A[i];

            // deque更新
            while (not deqs[k].empty() && dp[k][deqs[k].back()] <= dp[k][i]){
                deqs[k].pop_back();
            }
            deqs[k].emplace_back(i);

            // 先頭からpop
            if (deqs[k].front() == i - M){
                deqs[k].pop_front();
            }
        }

    }

//    REP(k, K+1) { print(k, dp[k]); }

    ll ans = 0;
    REP(i, N){
        ans = max(ans, dp[K][i]);
    }
    print(ans);


    return 0;
}