#include <bits/stdc++.h>

using namespace std;

ifstream F("ferma.in");
ofstream G("ferma.out");

int n, k, v[10005], l, r, L, R;
long long s, sm, S;
bitset<10005> w;

int main()
{
    F >> n >> k;
    for(int i = 1; i <= n; ++ i) F >> v[i]; v[++n] = v[1];
    for(int j = 1; j <= k; ++ j)
    {
        s = v[1]; sm = -1<<30; l = r = 1; L = R = 1;
        for(int i = 2; i <= n; ++ i)
        {
            if(w[i]) continue;
            if(w[i-1]) s = v[i], l = r = i;
            else if(s < 0) s = v[i], l = r = i;
            else s+v[i] > v[i] ? s = s + v[i] : s = v[i];
            if(sm < s) sm = s, L = l, R = r;
        }
        if(sm < 0) sm = 0;
        S += sm;
        for(int i = L; i <= R; ++ i) w[i] = 1;
    }
    G << S;
    return 0;
}