#include <bits/stdc++.h>
using namespace std;

int n, k;
int a[10005], s[10005];
int dp[1005][10005];
int main()
{
    freopen("ferma.in", "r", stdin);
    freopen("ferma.out", "w", stdout);

    scanf("%d%d", &n, &k);
    for(int i = 1; i <= n ; ++i) scanf("%d", &a[i]), s[i] = s[i - 1] + a[i];

    for(int i = 1; i <= k ; ++i){
        dp[i][i] = s[i];
        int aux = dp[i - 1][i] - s[i];
        for(int j = i + 1; j <= n ; ++j){
            dp[i][j] = max(dp[i][j - 1], s[j] + aux);
            aux = max(aux, dp[i - 1][j] - s[j]);
        }
    }
    int Sol = 0;
    for(int j = k; j <= n ; ++j)
        Sol = max(Sol, dp[k][j]);

    for(int j = 2; j <= n ; ++j)
        dp[1][j] = max(s[j], dp[1][j - 1]);

    for(int i = 2; i <= k ; ++i){
        dp[i][i] = s[i];
        int aux = dp[i - 1][i] - s[i];
        for(int j = 1; j <= n ; ++j){
            dp[i][j] = max(dp[i][j - 1], s[j] + aux);
            aux = max(aux, dp[i - 1][j] - s[j]);
        }
    }

    for(int j = k; j <= n ; ++j)
        Sol = max(Sol, dp[k][j] + s[n] - s[j]);
    printf("%d", Sol);

    return 0;
}