#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<sstream>
#include<bitset>
#include<numeric>
#include<climits>
using namespace std;

typedef long long ll;

template<typename A,typename B>inline void chmin(A &a, B b) { if (a > b)a = b; }
template<typename A,typename B>inline void chmax(A &a, B b) { if (a < b)a = b; }
const int INF = 1001001001;

int n, m;
int w[3000];

int dp[2][3010][2];

int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++)cin >> w[i];
	
	int ans = -INF;

	for (int t = 0; t < 2; t++) {
		for (int i = 0; i < 2; i++)for (int j = 0; j < 3010; j++)for (int k = 0; k < 2; k++)dp[i][j][k] = -INF;
		//fill_n(**dp, 2 * 3010 * 2, -INF);
		dp[1][t][t] = 0;
		for (int i = 1; i < n; i++) {
			for (int j = 0; j <= m; j++) {
				for (int k = 0; k < 2; k++) {
					if (dp[i & 1][j][k] == -INF)continue;
					chmax(dp[(i + 1) & 1][j + 1][1], dp[i & 1][j][k] + k*w[i - 1]);
					chmax(dp[(i + 1) & 1][j][0], dp[i & 1][j][k]);
					dp[i & 1][j][k] = 0;
				}
			}
		}
		for (int i = 0; i < 2; i++)chmax(ans, dp[n & 1][m][i] + (i&t)*w[n - 1]);
	}

	cout << ans << endl;
	return 0;
}