#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

int dp [4][3002];
int dp_[4][3002];
int w[3002];

int main(){
	int n,m;
	//cin >> n >> m;
	scanf("%d%d", &n,&m);
	//vector<int> w(n);
	//cin >> w;
	//for(int& x:w) scanf("%d", &x);
	for(int i=0; i<n; i++) scanf("%d", &w[i]);
	
	if(m<=1){
		cout << 0 << endl;
		return 0;
	}
	if(n==m){
		printf("%d\n", accumulate(w, w+n, 0));
		return 0;
	}
	
	const int inf = 100000000;
	for(int i=0; i<4; i++){
		fill(dp[i], dp[i]+m+2, -inf);
		fill(dp_[i], dp_[i]+m+2, -inf);
	}
	
	//vector<vector<vector<int>>> dp (2,vector<vector<int>>(2,vector<int>(m+2, -inf)));
	//vector<vector<vector<int>>> dp_(2,vector<vector<int>>(2,vector<int>(m+2, -inf)));
	
	dp[0b00][0] = 0;
	dp[0b11][1] = 0;
	
	for(int i=1; i<n; i++){
		for(int k=max(0,m-(n-i)); k<=min(i,m); ++k){
			dp_[0b00][k]   = max({dp_[0b00][k],   dp[0b00][k], dp[0b01][k]});
			dp_[0b01][k+1] = max({dp_[0b01][k+1], dp[0b00][k], dp[0b01][k]+w[i-1]});
			
			dp_[0b10][k]   = max({dp_[0b10][k],   dp[0b10][k], dp[0b11][k]});
			dp_[0b11][k+1] = max({dp_[0b11][k+1], dp[0b10][k], dp[0b11][k]+w[i-1]});
			
			dp[0b00][k] = dp[0b01][k] = dp[0b10][k] = dp[0b11][k] = -inf;
		}
		swap(dp, dp_);
	}
	int ans = max({dp[0b00][m], dp[0b01][m], dp[0b10][m], dp[0b11][m]+w[n-1]});
	printf("%d\n", ans);
	//cout << ans << endl;
	return 0;
}