#include <bits/stdc++.h>
using namespace std;

template<typename T>
struct Segtree {
    int n, n_org;
    T e;
    vector<T> dat;
    typedef function<T(T a, T b)> Func;
    Func f;

    Segtree(){}
    Segtree(int n_input, Func f_input, T e_input){
        initialize(n_input, f_input, e_input);
    }
    void initialize(int n_input, Func f_input, T e_input){
        n_org = n_input;
        f = f_input;
        e = e_input;
        n = 1;
        while(n < n_input) n <<= 1;
        dat.assign(2*n-1, e);
    }

    void build(vector<T>& A){
        for(int k=0; k<int(A.size()); k++) dat[k+n-1] = A[k];
        for(int k=n-2; k>=0; k--) dat[k] = f(dat[2*k+1], dat[2*k+2]);
    }

    void update(int k, T a){
        k += n - 1;
        dat[k] = a;
        while(k > 0){
            k = (k - 1)/2;
            dat[k] = f(dat[2*k+1], dat[2*k+2]);
        }
    }

    T get(int k){
        return dat[k+n-1];
    }

    T between(int a, int b){
        return query(a, b+1, 0, 0, n);
    }

    T query(int a, int b, int k, int l, int r){
        if(r<=a || b<=l) return e;
        if(a<=l && r<=b) return dat[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return f(vl, vr);
    }

    // [S, t] が条件checkを満たす最大のtを求める
    int bisect(int S, function<bool(T a)> check){
        T val = get(S);
        int k = S+n-1, l = S, r = S+1;
        while(true){
            while(k%2) k = (k-1)/2, r += r-l;
            T val2 = f(val, dat[k]);
            if(check(val2)){
                if(r == n) return n_org-1;
                val = val2;
                k++;
                int d = r-l;
                l += d, r += d;
            }else{
                break;
            }
        }
        while(k<n-1){
            T val2 = f(val, dat[2*k+1]);
            if(check(val2)){
                val = val2;
                k = 2*k+2;
                l = (l+r)/2;
            }else{
                k = 2*k+1;
                r = (l+r)/2;
            }
        }
        return min(l, n_org)-1;
    }
};

int main(){
    int N, K, M;
    cin >> N >> K >> M;
    vector<int> A(N);
    for(int i=0; i<N; i++) cin >> A[i];
    Segtree<int64_t> st[3001][2];
    vector<int64_t> init(N+1, -1e15);
    for(int k=0; k<=K; k++) for(int l=0; l<2; l++){
        st[k][l].initialize(N+1, [](auto a, auto b){ return max(a, b); }, -1e18);
        st[k][l].build(init);
    }
    for(int l=0; l<2; l++) st[0][l].update(0, 0);
    
    int64_t S = 0;

    for(int i=0; i<N; i++){
        S += A[i];
        int L = max(i-M+1, 0);
        for(int k=1; k<=K; k++){
            int64_t v = max(st[k-1][0].between(L, i) + S, st[k-1][1].between(L, i) - S);
            st[k][0].update(i+1, v - S);
            st[k][1].update(i+1, v + S);
        }
    }
    cout << st[K][0].between(N, N) + S << endl;
    return 0;
}