#include <bits/stdc++.h>
using namespace std;
ifstream in("ferma.in");
ofstream out("ferma.out");
const int N = 10005;
const int K =  1005;
int dp[K][N],v[N],s[N];
int main()
{
    int n,k;
    in >> n >> k;
    for(int i = 1; i<=n; i++)
    {
        in >> v[i];
        s[i] = s[i-1] + v[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 = 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]);
        }
    }

    for(int j = k; j<=n; j++)
        sol = max(sol, dp[k][j] + s[n] - s[j]);
    out << sol;
    return 0;
}