#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000000

template <typename T,typename F>
struct SWAG{
	F func;
	T init_value;
	vector<pair<T,T>> X,Y;
	SWAG(F f,T iv):func(f){
		init_value = iv;
	}
	
	void push_front(T x){
		if(X.empty())X.push_back({x,x});
		else X.push_back({x,func(x,X.back().second)});
	}
	
	void push_back(T x){
		if(Y.empty())Y.push_back({x,x});
		else Y.push_back({x,func(Y.back().second,x)});
	}
	
	void pop_front(){
		if(X.empty()){
			int n = Y.size();
			vector<T> t;
			for(int i=0;i<n/2;i++){
				t.push_back(Y.back().first);
				Y.pop_back();
			}
			while(!Y.empty()){
				push_front(Y.back().first);
				Y.pop_back();
			}
			while(!t.empty()){
				push_back(t.back());
				t.pop_back();
			}
			if(!X.empty())X.pop_back();
		}
		else{
			X.pop_back();
		}
	}
	
	void pop_back(){
		if(Y.empty()){
			int n = X.size();
			stack<T> t;
			for(int i=0;i<n/2;i++){
				t.push_back(X.back().first);
				X.pop_back();
			}
			while(!X.empty()){
				push_back(X.back().first);
				X.pop_back();
			}
			while(!t.empty()){
				push_front(t.back());
				t.pop_back();
			}
			if(!Y.empty())Y.pop_back();
		}
		else{
			Y.pop_back();
		}
	}
	
	T get(){
		T ret = init_value;
		if(!X.empty())ret = func(ret,X.back().second);
		if(!Y.empty())ret = func(ret,Y.back().second);
		return ret;
	}
	
	T front(){
		if(!X.empty())return X.back().first;
		if(!Y.empty())return Y[0].first;
		return init_value;
	}
	
	T back(){
		if(!Y.empty())return Y.back().first;
		if(!X.empty())return X[0].first;
		return init_value;
	}
	
	int size(){
		return X.size()+Y.size();
	}
	
};

int main(){
	int N,K,M;
	cin>>N>>K>>M;
	vector<long long> A(N);
	for(int i=0;i<N;i++)cin>>A[i];

	vector<long long> S(N+1,0);
	for(int i=1;i<=N;i++){
		S[i] = S[i-1] + A[i-1];
	}
	
	auto f = [](long long a,long long b){
		return max(a,b);
	};
	
	vector<SWAG<long long,decltype(f)>> Sm(K+1,SWAG<long long,decltype(f)>(f,-Inf)),Sp(K+1,SWAG<long long,decltype(f)>(f,-Inf));
	
	vector<vector<long long>> dp(N+1,vector<long long>(K+1,-Inf));
	dp[0][0] = 0LL;
	Sm[0].push_back(0LL);
	Sp[0].push_back(0LL);
	
	for(int i=1;i<=N;i++){
		for(int j=1;j<=K;j++){
			if(Sm[j-1].size()==0)continue;
			if(Sm[j-1].size()>M){
				Sm[j-1].pop_front();
			}
			if(Sp[j-1].size()>M){
				Sp[j-1].pop_front();
			}
			dp[i][j] = max(Sm[j-1].get() + S[i],Sp[j-1].get() - S[i]);
		}
		for(int j=1;j<=K;j++){
			if(dp[i][j]<0LL)continue;
			Sm[j].push_back(dp[i][j]-S[i]);
			Sp[j].push_back(dp[i][j]+S[i]);
		}
	}
	
	cout<<dp.back().back()<<endl;
	
	return 0;
}