// (？ω？)＜MLEかな?
#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int inf = 987654321;
int n, m;
vector<int> w;
vector<vector<vector<vector<int>>>> dp;

// i番目まで見た。j個の頂点を取った。before: 前を取った? first: 最初を取った?
// 最大の価値を返す。
int rec(int i, int j, bool before, bool first) {
  int &res = dp[before][first][i][j];
  if(i==n) {
    if(j==m) {
      return res = (before&&first ? w[i-1] : 0);
    } else {
      return res = -inf;
    }
  }
  if(res != -inf+1) { return res; }
  res = rec(i+1, j, false, first);
  if(j < m) {
    res = max(res, rec(i+1, j+1, true, first) + (before ? w[i-1] : 0));
  }
  return res;
}

int main(void) {
  scanf("%d%d", &n, &m);
  w.assign(n, 0);
  dp.assign(2, vector<vector<vector<int>>>(2, vector<vector<int>>(n+1, vector<int>(m+1, -inf+1))));
  for(int i : range(n)) { scanf("%d", &w[i]); }
  int res = max(rec(1, 1, true, true), rec(1, 0, false, false));
  printf("%d\n", res);
  return 0;
}