#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<=1){
		cout << 0 << endl;
		return 0;
	}
	if(n==m){
		printf("%d\n", accumulate(w.begin(), w.end(), 0));
		return 0;
	}
	
	const int inf = 100000000;
	
	//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)));
	vector<vector<int>> dp(4, vector<int>(m+2, -inf));
	vector<vector<int>> dp_(4, vector<int>(m+2, -inf));
	
	//dp[0][0][0] = 0;
	//dp[1][1][1] = 0;
	
    dp[0][0] = 0;
    dp[3][1] = 0;
    
    for(int i=1; i<n; i++){
        for(int k=max(0,m-(n-i)); k<=min(i,m); ++k){
            dp_[0][k]   = max(dp_[0][k],   max(dp[0][k], dp[1][k]));
            dp_[1][k+1] = max(dp_[1][k+1], max(dp[0][k], dp[1][k]+w[i-1]));
            
            dp_[2][k]   = max(dp_[2][k],   max(dp[2][k], dp[3][k]));
            dp_[3][k+1] = max(dp_[3][k+1], max(dp[2][k], dp[3][k]+w[i-1]));
            
            dp[0][k] = dp[1][k] = dp[2][k] = dp[3][k] = -inf;
        }
        swap(dp, dp_);
    }
	
    int ans = max({dp[0][m], dp[1][m], dp[2][m], dp[3][m]+w[n-1]});
	/*
	for(int i=1; i<n; i++){
		for(int k=max(0,m-(n-i)); k<=min(i,m); ++k){
			dp_[0][0][k]   = max({dp_[0][0][k],   dp[0][0][k], dp[0][1][k]});
			dp_[0][1][k+1] = max({dp_[0][1][k+1], dp[0][0][k], dp[0][1][k]+w[i-1]});
			
			dp_[1][0][k]   = max({dp_[1][0][k],   dp[1][0][k], dp[1][1][k]});
			dp_[1][1][k+1] = max({dp_[1][1][k+1], dp[1][0][k], dp[1][1][k]+w[i-1]});
			
			dp[0][0][k] = dp[0][1][k] = dp[1][0][k] = dp[1][1][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;
}