#include <iostream>
#include <vector>
#include <cmath>
#include <climits>

using namespace std;

const int NEG_INF = -1000000000; 

int main() {
    int N, K, M;
    cin >> N >> K >> M;
    vector<int> A(N + 1, 0), prefix(N + 1, 0);

    
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
        prefix[i] = prefix[i - 1] + A[i];
    }

    
    vector<vector<int>> dp(N + 1, vector<int>(K + 1, NEG_INF));
    dp[0][0] = 0;

    for (int i = 1; i <= N; i++) {
        for (int k = 1; k <= min(i, K); k++) {
            for (int len = 1; len <= min(M, i); len++) {
                int j = i - len;
                if (dp[j][k - 1] == NEG_INF) continue; 
                int sum = prefix[i] - prefix[j];
                dp[i][k] = max(dp[i][k], dp[j][k - 1] + abs(sum));
            }
        }
    }

    cout << dp[N][K] << endl;
    return 0;
}