#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

#define PQ(T) priority_queue<T>
#define RPQ(T) priority_queue<T,vector<T>,greater<T>>

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }


const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


template <typename T1, typename T2>
vector<T2> accum(vector<T1>& a, T2 init) {
    int L = a.size();
    vector<T2> acc(L + 1);
    acc[0] = init;
    for (int i=0; i<L; ++i) acc[i+1] = acc[i] + a[i];
    return move(acc);
}

template <typename T>
T accumed(vector<T>& acc, int from, int to) {
    int M = acc.size() - 1;
    return acc[min(M, to)] - acc[max(0, from)];
}



ll solve(int N, int K, vi& a) {
    vi ac = accum(a, 0);

    vvi dpl(N+1, vi(max(N,K)+1, INT_MIN)), dpr(N+1, vi(max(N,K)+1, INT_MIN));
    dpl[0][0] = dpr[0][0] = 0;

    {
        int suml = 0; set<int> s;
        for (int i=1; i<=N; ++i) {
            suml += a[i-1];
            dpl[i][i] = suml;
            s.insert(a[i-1]);
            auto it = s.begin();
            int sumy = suml, cnt = 0;
            while (it != s.end()) {
                if (*it >= 0) break;
                ++cnt;
                sumy -= *it; ++it;
                if (i+cnt > K) break;
                dpl[i][i+cnt] = sumy;
            }
        }
    }
    {
        int sumr = 0; set<int> s;
        for (int i=1; i<=N; ++i) {
            sumr += a[N - i];
            dpr[i][i] = sumr;
            s.insert(a[N - i]);
            auto it = s.begin();
            int sumy = sumr, cnt = 0;
            while (it != s.end()) {
                if (*it >= 0) break;
                ++cnt;
                sumy -= *it; ++it;
                if (i+cnt > K) break;
                dpr[i][i+cnt] = sumy;
            }
        }
    }

    int best = 0;
    for (int l=0; l<=N; ++l) {
        for (int i=0; i<=K; ++i) {
            int u = dpl[l][i];
            if (u == INT_MIN) continue;

            for (int r=0; l+r<=N; ++r) {
                for (int j=0; i+j<=K; ++j) {
                    int v = dpr[r][j];
                    if (v == INT_MIN) continue;
                    amax(best, u + v);
                }
            }
        }
    }
    return best;
}

int main() {
    int N, K; scanf("%d%d", &N, &K); read_cr();
    vi a(N);
    loadvec(a, N);
    cout << solve(N,K,a) << endl;
    return 0;
}


Measured memory_bytes: 256