#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;


signed main(){
	cout<<fixed<<setprecision(10);
	
	int N, K, M;
	vector<int> A;
	vector<int> sum;
	vector<vector<int>> dp;
	vector<pair<int,int>> q, q2;
	cin>>N>>K>>M;
	
	A.resize(N);
	dp.resize(N+1, vector<int>(K+1, -INF));
	sum.resize(N+1);
	
	q.resize(N+2);
	q2.resize(N+2);
	
	for(int i = 0; i < N; i++){
		cin>>A[i];
	
		sum[i+1] = sum[i] + A[i];
		
		if(i < M) dp[i][1] = abs(sum[i+1]);
	}

	for(int j = 2; j <= K; j++){
		int f = 0, e = 0;
		int f2 = 0, e2 = 0;
		
		for(int i = j-1; i < N; i++){
			int num = dp[i-1][j-1] - sum[i];
			int num2 = dp[i-1][j-1] + sum[i];
			
			while(e - f && q[e].second < num) e--;
			q[e+1] = {i,num}; e++;
			while(e - f && q[f].first < i - M + 1) f++;
			
			while(e2 - f2 && q2[e2].second < num2) e2--;
			q2[e2+1] = {i,num2}; e2++;
			while(e2 - f2 && q2[f2].first < i - M + 1) f2++;
			
			if(e - f) dp[i][j] = max(q[f].second + sum[i+1],dp[i][j]);
			if(e2 - f2) dp[i][j] = max(dp[i][j], q2[f2].second - sum[i+1]);
		}
	}
	
	cout<<dp[N-1][K]<<endl;
	
	return 0;
}