//↓見なくていいよ！ここから--------------------------------------------------
var read = require('readline').createInterface({
  input: process.stdin,
  output: process.stdout
});
var obj;
var inLine = [];
read.on('line', function(input){inLine.push(input);});
read.on('close', function(){
  obj = init(inLine);
  console.error("\n");
  var start = Date.now();
  Main();
  var end = Date.now() - start;
  myerr("time : " + (end) + "ms");
  myerr("memory : " + Math.round(process.memoryUsage().heapTotal / 1024) + "KB");
});
function makeClone(obj){return JSON.parse(JSON.stringify(obj));}
function nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);}
function nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();}
function init(input){  
  var returnObj = {
    list : input, index : 0, max : input.length,
    hasNext : function(){return (this.index < this.max);},
    next : function(){if(!this.hasNext()){throw "ArrayIndexOutOfBoundsException これ以上ないよ";}else{var returnInput = this.list[this.index];this.index++;return returnInput;}}
  };
  return returnObj;
}
function myout(s){console.log(s);}
function myerr(s){console.error("debug:" + require("util").inspect(s,false,null));}
//[no]要素の扱い。数値型
//不明値、異常時:引数そのまま返す 1:数値へ変換
//2:半角SPで分割 4:半角SPで分割し、数値配列へ
//6:1文字で分割  7:1文字で分割し、数値配列へ
//8:半角SPで結合 9:改行で結合 0:文字なしで結合
function myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(" ");case 4:return i.split(" ").map(Number);case 6:return i.split("");case 7:return i.split("").map(Number);case 8:return i.join(" ");case 9:return i.join("\n");case 0:return i.join("");default:return i;}}catch(e){return i;}}

//↑見なくていいよ！ここまで--------------------------------------------------
function Main(){
	var one = nextIntArray();
	var N = one[0];
	var K = one[1];
	var list = nextIntArray();
	if(false){
		//全部とれる場合
		list.sort(function(a,b){
			return a - b;
		});
		for(var i = 0; i < K - N; i++){
			if(list[0] < 0){
				list.shift();
			}else{
				break;
			}
		}
		var sum = 0;
		for(var i = 0; i < list.length; i++){
			sum += list[i];
		}
		myout(sum);
	}else{
		K = Math.min(K, N);
		//全部とれない場合
		//左端から全部とる、左端からK - 1、右端から1個、・・右端から全部とる
		//↑これをK = 1～できるだけやる？
		//K未満だったら、残回数でマイナスを捨てていく
		var max = 0;
		for(var i = 1; i <= K; i++){
			//i : 取り出す回数(全体)
			
			for(var j = 0; j <= i; j++){//j : 左から取り出す回数
				var maelist = makeClone(list);
				var maeGetlist = [];
				var right = i - j;
				for(var k = 0; k < j; k++){
					maeGetlist.push(maelist.shift());
				}
				for(var k = 0; k < right; k++){
					maeGetlist.push(maelist.pop());
				}
				maeGetlist.sort(function(a,b){
					return a - b;
				});
				var ret = K - i;
				for(var k = 0; k < ret; k++){
					if(maeGetlist[0] < 0){
						maeGetlist.shift();
					}else{
						break;
					}
				}
				var sum = 0;
				for(var k = 0; k < maeGetlist.length; k++){
					sum += maeGetlist[k];
				}
				
				max = Math.max(max, sum);
			}
		}
		myout(max);
	}
}
