#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("ferma.in");
ofstream fout("ferma.out");

int N, K, sol, maxim;
int V[10005], dp[1005][10005], S[10005];

int main()
{
    fin >> N >> K;
    for (int i = 1; i <= N; ++i)
    {
        fin >> V[i];
        S[i] = S[i - 1] + V[i];
    }
    dp[1][1] = max(0, V[1]);
    maxim = V[1];
    for (int i = 2; i <= N; ++i)
    {
        dp[1][i] = max(dp[1][i - 1], S[i] - maxim);

        maxim = min(maxim, S[i]);
    }
    for (int i = 2; i <= K; ++i)
    {
        dp[i][1] = max(0, V[1]);
        maxim = dp[i - 1][1] - S[1];
        for (int j = 2; j <= N; ++j)
        {
            dp[i][j] = max(dp[i][j - 1], maxim + S[j]);
            maxim = max(maxim, dp[i - 1][j] - S[j]);
        }
    }

    sol = dp[K][N];

    for (int i = 1; i <= N; ++i)
        dp[1][i] = max(dp[1][i - 1], S[i]);
    for (int i = 2; i <= K; ++i)
    {
        dp[i][1] = max(0, V[1]);
        maxim = dp[i - 1][1] - S[1];
        for (int j = 2; j <= N; ++j)
        {
            dp[i][j] = max(dp[i][j - 1], maxim + S[j]);
            maxim = max(maxim, dp[i - 1][j] - S[j]);
        }
    }

    for (int i = 1; i <= N; ++i)
        sol = max(sol, dp[K][i] + S[N] - S[i]);

    fout << sol << '\n';

    fin.close();
    fout.close();
    return 0;
}