#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

ll dp[3001][3001][2];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, K, M;
	cin >> N >> K >> M;
	int A[3000];
	rep(i, N) cin >> A[i];

	rep(i, N + 1) rep(j, K + 1) rep(k, 2) dp[i][j][k] = -1e18;
	dp[0][0][0] = 0;
	dp[0][0][1] = 0;
	M = min(M, N - K + 1);
	rep(i, N) {
		rep(j, min(K, i) + 1) {
			ll tmp0 = dp[i][j][0];
			ll tmp1 = dp[i][j][1];
			int k = 1;
			for (; k <= M && i + k <= N; k++) {
				tmp0 += A[i + k - 1];
				tmp1 -= A[i + k - 1];
				chmax(dp[i + k][j + 1][1], tmp0);
				chmax(dp[i + k][j + 1][0], tmp1);
			}
			chmax(dp[i + k - 1][j + 1][0], tmp0);
			chmax(dp[i + k - 1][j + 1][1], tmp1);
		}
	}

	ll kotae = -1e18;
	rep1(j, K) {
		chmax(kotae, dp[N][j][0]);
		chmax(kotae, dp[N][j][1]);
	}
	co(kotae);

	Would you please return 0;
}