//↓見なくていいよ！ここから--------------------------------------------------
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 = new Date();
  Main();
  var end = new Date() - start;
  myerr("time : " + (end) + "ms");
  myerr("memory : " + Math.round(process.memoryUsage().heapTotal / 1024) + "KB");
});
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();
  var output = 0;
  dfs(0,list, []);
  myout(output);
  function dfs(count, queue, have){
    if(count == K){
      var sum = 0;
      for(var i = 0; i < have.length; i++){
        sum += have[i];
      }
      output = Math.max(output, sum);
      return;
    }
    //queueにモノがあるなら左から取る、右から取る
    //haveにマイナスがあるならqueueに左から戻す、右から戻す
    if(queue.length > 0){
      if(queue.length > 1){
        var caughtLeft = JSON.parse(JSON.stringify(have));
        var removeLeftQueue = JSON.parse(JSON.stringify(queue));
        var getLeft = removeLeftQueue.shift();
        caughtLeft.push(getLeft);
        caughtLeft.sort(ascSort);
        dfs(count + 1, removeLeftQueue, caughtLeft);
        
        var caughtRight = JSON.parse(JSON.stringify(have));
        var removeRightQueue = JSON.parse(JSON.stringify(queue));
        var getRight = removeRightQueue.pop();
        caughtRight.push(getRight);
        caughtRight.sort(ascSort);
        dfs(count + 1, removeRightQueue, caughtRight);
      }else{
        var caught = JSON.parse(JSON.stringify(have));
        var removeQueue = JSON.parse(JSON.stringify(queue));
        var get = removeLeftQueue.shift();
        caught.push(get);
        caught.sort(ascSort);
        dfs(count + 1, removeQueue, caught);
      }
    }
    if(have.length > 0 && have[0] < 0){
      var removeHave = JSON.parse(JSON.stringify(have));
      var get = removeHave.shift();
      if(queue.length > 0){
        var queueAddLeft = JSON.parse(JSON.stringify(queue));
        queueAddLeft.unshift(get);
        dfs(count + 1, queueAddLeft, removeHave);
        
        var queueAddRight = JSON.parse(JSON.stringify(queue));
        queueAddRight.push(get);
        dfs(count + 1, queueAddRight, removeHave);
      }else{
        var queueAdd = JSON.parse(JSON.stringify(queue));
        queueAdd.push(get);
        dfs(count + 1, queueAdd, removeHave);
      }
    }
  }
}
function ascSort(a,b){
  return a - b;
}
