import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10^^9;

int N, M;
int[] W;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      W = new int[N];
      foreach (i; 0 .. N) {
        W[i] = readInt();
      }
      
      long ans = -INF;
      foreach (s; 0 .. 2) {
        auto dp = new long[][][](N + 1, N + 1, 2);
        foreach (i; 0 .. N + 1) foreach (j; 0 .. N + 1) {
          dp[i][j][] = -INF;
        }
        dp[0][0][s] = 0;
        foreach (i; 0 .. N) foreach (j; 0 .. N) foreach (t; 0 .. 2) {
          if (dp[i][j][t] > -INF) {
            chmax(dp[i + 1][j][0], dp[i][j][t]);
            chmax(dp[i + 1][j + 1][1], dp[i][j][t] + (t ? W[i] : 0));
          }
        }
        chmax(ans, dp[N][M][s]);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}