#include <cstdio>
#include <cstring>
#include <algorithm>
#include <deque>
#define maxN 10002
#define maxK 1002
using namespace std;
int n, i, j, k, v[maxN], sum, dp[2][maxN], sol;
deque < pair < int, int > > d;
void read()
{
    freopen("ferma.in", "r", stdin);
    scanf("%d %d", &n, &k);
    for (i = 1; i <= n; ++ i)
        scanf("%d", &v[i]),
             v[i + n] = v[i];
}
void solve()
{
    for (j = 1; j <= k; ++ j)
    {
        sum = 0;
        for (i = 1; i <= 2 * n; ++ i)
        {
            sum += v[i];
            if (d.front().first - i == n)
                d.pop_front();
            dp[1][i] = d.front().first + sum;
            if (j == k)
                sol = max(sol, dp[1][i]);
            while (!d.empty() && dp[0][i] - sum >= d.back().first)
                d.pop_back();
            d.push_back(make_pair(dp[0][i] - sum, i));
        }
        memcpy(dp[0], dp[1], sizeof(dp));
    }
}
void print()
{
    freopen("ferma.out", "w", stdout);
    printf("%d", sol);
}
int main()
{
    read();
    solve();
    print();
    return 0;
}