import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int n, k; readV(n, k);
  int[] v; readA(n, v);

  auto r = 0;
  foreach (a; 0..n+1)
    foreach (b; 0..n+1) {
      if (a+b > n || a+b > k) continue;
      auto w = (v[0..a] ~ v[$-b..$]).dup;
      w.sort();
      foreach (i; 0..min(w.length, k-a-b))
        if (w[0] < 0) w = w[1..$];
        else break;
      r = max(r, w.sum);
    }

  writeln(r);
}
