#include <bits/stdc++.h>

using namespace std;

long long int dp[2][3001];
long long int C[3001][3001];
vector <long long int> v;
int N, K, M;

void solve(int t, int l, int r, int s, int e)
{
	if (l > r)
	{
		return;
	}
	int m = (l + r) / 2;
	dp[1][m] = dp[0][s - 1] + C[s][m];
	int opt = s;
	int end = min(e, m);
	for (int k = s + 1; k <= end; k++)
	{
		if (m - k + 1 > M)
		{
			break;
		}
		long long int val = dp[0][k - 1] + C[k][m];
		if (dp[1][m] < val)
		{
			dp[1][m] = val;
			opt = k;
		}
	}
	if (l != r)
	{
		solve(t, l, m - 1, s, opt);
		solve(t, m + 1, r, opt, e);
	}
}
int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	cin >> N >> K >> M;
	for (int i = 0; i < N; i++)
	{
		int t;
		cin >> t;
		v.push_back(t);
	}

	for (int i = 1; i <= N; i++)
	{
		long long int sum = 0;
		for (int j = i; j <= N; j++)
		{
			sum += v[j - 1];
			//cout << i << ' ' << j << ' ' << sum << '\n';
			C[i][j] = abs(sum);
		}
	}

	for (int i = 1; i <= N; i++)
	{
		dp[1][i] = -1e18;
	}
	dp[1][0] = 0;
	for (int i = 1; i <= K; i++)
	{
		memcpy(dp[0], dp[1], sizeof(dp[1]));
		fill(dp[1], dp[1] + 3001, -1e18);
		solve(i, i, N, i, N);
	}

	cout << dp[1][N] << '\n';

	return 0;
}