#include <bits/stdc++.h>

using namespace std;

const int max_k = 1e3 + 20, max_n = 1e4 + 20;

int dp[max_k][max_n], sp[max_n];

void solve ()
{
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        cin >> sp[i];
        sp[i] += sp[i - 1];
    }
    /// first try - liniar (nu fortez 1 in subsecv)
    for (int i = 1; i <= k; i++)
    {
        int mx = dp[i - 1][i - 1] - sp[i - 1];
        for (int j = i; j <= n; j++)
        {
            dp[i][j] = max(dp[i][j - 1], mx + sp[j]);
            mx = max(mx, dp[i - 1][j] - sp[j]);
        }
    }
    int ans = dp[k][n];
    /// 2nd try - circular (fortez 1 in subsecv)
    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 mx = dp[i - 1][i - 1] - sp[i - 1];
        for (int j = i; j <= n; j++)
        {
            dp[i][j] = max(dp[i][j - 1], mx + sp[j]);
            mx = max(mx, dp[i - 1][j] - sp[j]);
        }
    }
    for (int i = k; i <= n; i++)
    {
        ans = max(ans, dp[k][i] + sp[n] - sp[i]);
    }
    cout << ans;
    cout << '\n';
}

signed main ()
{
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#else
    //freopen("search.in", "r", stdin);
    //freopen("search.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    long long tt;
    //cin >> t;
    tt = 1;
    while (tt--)
    {
        solve();
    }
    return 0;
}