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

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto K = RD;
	auto V = RDR.ARR;

	long[long] memo;
	long f(long l, long r, long[] arr, long remain)
	{
		if (l > r || remain == 0)
		{
			/*if (memo.get(-1, long.min) != long.min)
			{
				return memo[-1];
			}*/
			auto index = MAKE_IDX(arr);
			long ans;
			foreach (i; index)
			{
				if (arr[i] < 0 && remain > 0)
				{
					--remain;
					continue;
				}
				ans += arr[i];
			}
			//memo[-1] = ans;
			return ans;
		}

		auto key = remain * 10^^8 + l * 10^^4 + r;
		if (memo.get(key, long.min) != long.min)
		{
			return memo[key];
		}

		auto ans1 = f(l+1, r, arr ~ V[l], remain-1);
		auto ans2 = f(l, r-1, arr ~ V[r], remain-1);
		auto ans3 = f(r+1, r, arr, remain);
		long ans = max(max(ans1, ans2), ans3);
		memo[key] = ans;
		//debug writeln(ans);
		return ans;
	}

	auto ans = f(0, N-1, [], K);

	writeln(ans);
	stdout.flush();
	debug readln();
}