/// Preset de infoarena
#include <fstream>

using namespace std;

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

const int maxN = 10005;
int n, k;
int v[maxN], sp[maxN], dp[1005][maxN], ans;

int main()
{
    fin >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
        sp[i] = sp[i - 1] + v[i];
    }
    for(int i = 1; i <= k; i++)
    {
        int aux = dp[i - 1][i - 1] - sp[i - 1];
        for(int j = i; j <= n; j++)
        {
            dp[i][j] = max(dp[i][j - 1], aux + sp[j]);
            aux = max(aux, dp[i - 1][j] - sp[j]);
        }
    }
    ans = max(ans, dp[k][n]);
    for(int i = 1; i <= n; i++)
        dp[1][i] = max(dp[1][i - 1], sp[i]);
    for(int i = 2; i <= k; i++)
    {
        int aux = dp[i - 1][i - 1] - sp[i - 1];
        for(int j = i; j <= n; j++)
        {
            dp[i][j] = max(dp[i][j - 1], aux + sp[j]);
            aux = max(aux, dp[i - 1][j] - sp[j]);
        }
    }
    for(int i = k; i <= n; i++)
        ans = max(ans, dp[k][i] + sp[n] - sp[i]);
    fout << ans;
    return 0;
}