#include <bits/stdc++.h>
#define maxN 10002
#define maxK 1002
using namespace std;
int n, i, j, k, sol, sum[maxN], dp[maxK][maxN];
int maxx;
int x, y;
int v[maxN];
int main()
{
    freopen("ferma.in", "r", stdin);
    freopen("ferma.out", "w", stdout);
    scanf("%d %d", &n, &k);
   // scanf("%d", &y);
   // sum[1] = y;
    for(i = 1; i <= n; i++)
        scanf("%d", &v[i]), sum[i] = sum[i-1]+v[i];
    for(i = 1; i <= k; i++)
    {
        maxx = dp[i-1][i-1]-sum[i-1];
        for(j = i; j <= n; j++)
            dp[i][j] = max(maxx+sum[j], dp[i][j-1]), maxx=max(maxx, dp[i-1][j]+sum[j]);
    }
    sol = dp[k][n];
    dp[1][1] = v[1];
    for(i = 2; i <= n; i++)
        dp[1][i] = max(dp[1][i-1], sum[i]);
    for(i = 2; i <= k; i++)
    {
        maxx = dp[i-1][i-1]-sum[i-1];
        for(j = i; j <= n; j++)
        {
            dp[i][j]=max(dp[i][j-1], maxx+sum[j]);
            if(i == k && sol < dp[i][j]+sum[n]-sum[j])
                sol = dp[i][j]+sum[n]-sum[j];
            maxx = max(maxx, dp[i-1][j]-sum[j]);
        }
    }
    printf("%d", sol);
    return 0;
}