#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
void debug() { cerr << "\n"; }
template <class T> void debug(const T &x) { cerr << x << "\n"; }
template <class T, class... Args> void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
template <class T> void debugVector(const vector<T> &v) {
    for(const T &x : v) {
        cerr << x << " ";
    }
    cerr << "\n";
}
using ll = long long;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K, M;
    cin >> N >> K >> M;
    vector<ll> a(N), sum(N + 1, 0);
    for(int i = 0; i < N; i++) {
        cin >> a[i];
        sum[i + 1] = sum[i] + a[i];
    }
    vector dp(N + 1, vector(K + 1, -LLINF));
    vector<ll> mx1(K + 1, -LLINF), mx2(K + 1, -LLINF);
    mx1[0] = mx2[0] = 0;
    dp[0][0] = 0;
    for(int i = 0; i < N; i++) {
        for(int j = 1; j <= K; j++) {
            chmax(dp[i + 1][j], mx1[j - 1] - sum[i + 1]);
            chmax(dp[i + 1][j], mx2[j - 1] + sum[i + 1]);
        }
        for(int j = 0; j <= K; j++) {
            chmax(mx1[j], dp[i + 1][j] + sum[i + 1]);
            chmax(mx2[j], dp[i + 1][j] - sum[i + 1]);
        }
    }
    cout << dp[N][K] << endl;
}