#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

const int INF=12345678;

const int N=3000;
int n,m;
int w[N];

int dp[3001][3001][2][2];
int dfs(int now, int used, int before, int one)
{
    if(dp[now][used][before][one] > -INF) return dp[now][used][before][one];

    if(now==n)
    {
        if(used==m) return 0;
        return -INF;
    }

    int ret=-INF;
    // nowを選ぶ
    if(used<m)
    {
        int add=0;
        if(before) add+=w[now-1];
        if(now==n-1 && one) add+=w[n-1];

        ret=max(ret,dfs(now+1,used+1,1,one)+add);
    }
    // nowを選ばない
    ret=max(ret,dfs(now+1,used,0,one));

    return dp[now][used][before][one] = max(-INF,ret);
}

int main()
{
    scanf(" %d %d", &n, &m);
    rep(i,n) scanf(" %d", &w[i]);

    if(m==0) printf("0\n");
    else
    {
        rep(i,3001)rep(j,3001)rep(k,2)rep(l,2) dp[i][j][k][l]=-INF;
        printf("%d\n", max(dfs(1,0,0,0),dfs(1,1,1,1)));
    }
    return 0;
}