#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
constexpr int inf = 100000000;

int main(){
	int n,m;
	scanf("%d%d", &n,&m);
	vector<int> w(n);
	for(int& x:w) scanf("%d", &x);
	
	if(m<=1){
		printf("%d\n", 0);
		return 0;
	}
	if(n==m){
		printf("%d\n", accumulate(w.begin(), w.end(), 0));
		return 0;
	}
	
	vector<vector<int>> dp(m+2, vector<int>(4, -inf));
	vector<vector<int>> dp_(m+2, vector<int>(4, -inf));
	
    dp[0][0] = 0;
    dp[1][3] = 0;
    
    for(int i=1; i<n; ++i){
        for(int k=max(0,m-(n-i)); k<=min(i,m); ++k){
            dp_[k][0]   = max(dp_[k][0],   max(dp[k][0], dp[k][1]));
            dp_[k+1][1] = max(dp_[k+1][1], max(dp[k][0], dp[k][1]+w[i-1]));
            
            dp_[k][2]   = max(dp_[k][2],   max(dp[k][2], dp[k][3]));
            dp_[k+1][3] = max(dp_[k+1][3], max(dp[k][2], dp[k][3]+w[i-1]));
            
            dp[k][0] = dp[k][1] = dp[k][2] = dp[k][3] = -inf;
        }
        swap(dp, dp_);
    }
	
    int ans = max(max(dp[m][0], dp[m][1]), max(dp[m][2], dp[m][3]+w[n-1]));
	printf("%d\n", ans);
	return 0;
}