#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
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; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;


int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */

    ll n, k, m; scanf("%lld %lld %lld", &n, &k, &m);
    vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
    vector<ll> sum(n + 1); for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + a[i];
    vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, -INF));
    vector<ll> mx1(k + 1, -INF), mx2(k + 1, -INF);
    dp[0][0] = 0;
    mx1[0] = 0;
    mx2[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;
    return 0;
}