#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int n; int m;
	while(~scanf("%d%d", &n, &m)) {
		vector<int> w(n);
		for(int i = 0; i < n; ++ i)
			scanf("%d", &w[i]);
		int ans;
		if(m == n) {
			ans = accumulate(all(w), 0);
		} else if(m <= 1) {
			ans = 0;
		} else {
			vector<int> dp, ndp((m+1) * 4, -INF);
			ndp[0 * 4 + 0 * 2 + 0] = 0;
			ndp[1 * 4 + 1 * 2 + 1] = 0;
			reu(i, 1, n) {
				dp.swap(ndp);
				ndp.assign((m+1) * 4, -INF);
				rer(j, 0, m) rep(prev, 2) rep(first, 2) {
					int x = dp[j * 4 + prev * 2 + first];
					if(x == -INF) continue;
					amax(ndp[j * 4 + 0 * 2 + first], x);
					if(j < m)
						amax(ndp[(j+1) * 4 + 1 * 2 + first], x + (prev == 1 ? w[i-1] : 0));
				}
			}
			ans = -INF;
			rep(prev, 2) rep(first, 2)
				amax(ans, ndp[m * 4 + prev * 2 + first] + (prev == 1 && first == 1 ? w[n-1] : 0));
		}
		printf("%d\n", ans);
	}
	return 0;
}