#include <iostream>
#include <list>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T>
using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())



template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){if(a < b) a = b;}
template <class T> inline void chmin(T &a, T b){if(a > b) a = b;}
template <class T> inline void reverseSORT(Vec<T> &Array){
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k){return 1 << k;}
inline lli BitL(int k){return 1LL << k;}
inline void putsDouble(double d){printf("%.16lf\n", d);}
inline int toInt(const string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res;
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~





int main(void){
    int n, k; scanf("%d%d", &n, &k);
    Vint V(n); REP(i, n) scanf("%d", &V[i]);
    Wint Lv(n, Vint(0)), Rv(n, Vint(0));
    REP(i, n){
        for(int x = i; x < n; x++) Lv[x].emplace_back(V[i]);
    }
    REP(i, n){
        for(int x = n-i-1; x < n; x++) Rv[x].emplace_back(V[i]);
    }
    REP(i, n){
        SORT(Lv[i]);
        SORT(Rv[i]);
    }
    //cout << "A :\n   ";
    //vREP(ele, Rv[0]) cout << ele << ' '; putchar('\n');
    // 取り出す数
    lli res = 0;
    FOReq(x, 1, n){
        // 戻す数
        for(int y = 0; x+y <= k and y < x; ++y){
            int l = 0, r = x;
            for(; l <= x; l++, r--){
                lli cnt = 0;
                if(l == 0){
                    REP(i, x - y) cnt += Rv[r-1][r - i - 1];
                }
                else if(r == 0){
                    REP(i, x - y) cnt += Lv[l-1][l - 1 - i];
                }
                else{
                    Vint &L = Lv.at(l-1);
                    Vint &R = Rv.at(r-1);
                    int sl = l - 1, sr = r - 1;
                    REP(_, x - y){
                        if(sl == -1){
                            cnt += R[sr];
                            sr--;
                        }
                        else if(sr == -1){
                            cnt += L[sl];
                            sl--;
                        }
                        else{
                            if(L[sl] < R[sr]){
                                cnt += R[sr];
                                sr--;
                            }
                            else{
                                cnt += L[sl];
                                sl--;
                            }
                        }
                    }
                }
                //printf("x : %d, y : %d\n    (%d, %d) ~> %lld\n", x, y, l, r, cnt);
                chmax(res, cnt);
            }
        }
    }
    printf("%lld\n", res);
    return 0;
}

Measured memory_bytes: 256