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

istream& operator >> (istream& is, vector<int>& vec){ for(int& val: vec) scanf("%d", &val); return is;}
template<class T> istream& operator >> (istream& is, vector<T>& vec){ for(T& val: vec) is >> val; return is;}

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);
	
	if(m==0){
		cout << 0 << endl;
		return 0;
	}
	
	const int inf = 100000000;
	
	vector<vector<vector<int>>> dp (2,vector<vector<int>>(2,vector<int>(m+1, -inf)));
	vector<vector<vector<int>>> dp_(2,vector<vector<int>>(2,vector<int>(m+1, -inf)));
	
	dp[0][0][0] = 0;
	dp[1][1][1] = 0;
	
	for(int i=1; i<n; i++){
		for(int start=0; start<2; ++start)
		for(int last=0; last<2; ++last)
		for(int k=max(0,m-(n-i)); k<=min(i,m); ++k){
			if(dp[start][last][k] <= -inf) continue;
			dp_[start][0][k] = max(dp_[start][0][k], dp[start][last][k]);
			if(k+1<=m){
				dp_[start][1][k+1] = max(dp_[start][1][k+1], dp[start][last][k]+(last?w[i-1]:0) );
			}
			dp[start][last][k] = -inf;
		}
		swap(dp, dp_);
	}
	int ans = max({dp[0][0][m], dp[0][1][m], dp[1][0][m], dp[1][1][m]+w[n-1]});
	printf("%d\n", ans);
	//cout << ans << endl;
	return 0;
}