#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

ll solve(int n, int k, vector<ll> v){
    ll dp[n][k];
    fill(dp[0], dp[n], -INF);
    dp[0][0] = v[0];
    rep2(i, 0, n-2){
        rep(j, k){
            if(dp[i][j] == -INF) continue;
            if(j%2 == 0){
                chmax(dp[i+1][j], dp[i][j]+v[i+1]);
                if(j < k-1) chmax(dp[i+1][j+1], dp[i][j]-v[i+1]);
            }
            else{
                chmax(dp[i+1][j], dp[i][j]-v[i+1]);
                if(j < k-1) chmax(dp[i+1][j+1], dp[i][j]+v[i+1]);
            }
        }
    }
    ll ret = -INF;
    rep(i, k) chmax(ret, dp[n-1][i]);
    return ret;
}

int main(){
    int N, K, M;
    cin >> N >> K >> M;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    ll ans = solve(N, K, A);
    rep(i, N) A[i] *= -1;
    chmax(ans, solve(N, K, A));
    cout << ans << endl;
}