#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int dp[3001][3000][2];
int w[3000];
int n;

int dfs(int v, int m, bool fst) {
    if (dp[v][m][fst] != -2*INF)
        return dp[v][m][fst];
    if (v < n-1) {
        if (m > 0) {
            int i, ret = w[v] + dfs(v+1,m-1,fst);
            REP (i,v+2,n-1) ret = max(ret,dfs(i,m-1,fst));
            return dp[v][m][fst] = ret;
        }
        else
            return 0;
    }
    else if (m > 0)
        return -INF;
    else
        return fst ? w[n-1] : 0;
}

int main(void) {
    int i, j, m;
    cin >> n >> m;
    rep (i,n) cin >> w[i];
    rep (i,n+1) rep (j,m) dp[i][j][0] = dp[i][j][1] = -2*INF;
    int ans = dfs(0,m-1,true);
    REP (i,1,n) {
        ans = max(ans,dfs(i,m-1,false));
    }
    cout << ans << endl;
    return 0;
}