#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][3001][2];
int w[3001];

int main(void) {
    int i, j, k, n, m;
    cin >> n >> m;
    REP (i,1,n) cin >> w[i];

    REP (i,1,m) REP (j,1,n) rep (k,2) dp[i][j][k] = -INF;
    REP (j,1,n) dp[1][j][j==1] = 0;
    REP (i,2,m) rep (k,2) {
        int mx = -INF;
        REP (j,i,n) {
            dp[i][j][k] = max(mx,w[j-1] + dp[i-1][j-1][k]);
            mx = max(mx,dp[i-1][j-1][k]);
        }
        if (k == 1) dp[i][n][k] += w[n];
    }
    int ans = -INF;
    REP (j,1,n) rep (k,2) ans = max(ans,dp[m][j][k]);
    cout << ans << endl;
    return 0;
}