#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using namespace std;
typedef long long ll;

const int inf = 1e9;
int dp[3030][3030][2][2]; // i, num, take prev, take 0

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> w(n);
	rep (i, n) scanf("%d", &w[i]);

	rep (i, 3030) rep (j, 3030) rep (k, 2) rep (l, 2) dp[i][j][k][l] = -inf;
	dp[0][0][0][0] = 0;
	dp[0][1][1][1] = 0;
	rep (i, 1, n) rep (j, m + 1) rep (k, 2) rep (l, 2) {
		chmax(dp[i][j][0][l], dp[i - 1][j][k][l]);
		chmax(dp[i][j + 1][1][l], dp[i - 1][j][k][l] + w[i] * k);
	}
	int ans = -inf;
	rep (k, 2) rep (l, 2) {
		chmax(ans, dp[n - 1][m][k][l] + k * l * w[0]);
	}
	cout << ans << endl;
	return 0;
}