#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template<typename T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	ll N,K; cin >> N >> K;
	V<ll> a(N);
	for(int i = 0; i < N; ++i) cin >> a[i];
	V<V<ll>> dpL(N,V<ll>(K+1,0)),dpR(N,V<ll>(K+1,0));

	corner(N==1,max(0LL,a[0]));

	for(int i = 0; i < N; ++i){
		ll sum = 0;
		int num = 0;
		V<ll> b;
		for(int j = 0; j <= i && num < K; ++j){
			num++;
			sum += a[j];
			chmax(dpL[i][num],sum);
			if(a[j]<0)b.push_back(a[j]);
			
		}
		sort(ALL(b));
		for(int j = 0; j < b.size() && num < K; ++j){
			num++;
			sum -= b[j];
			chmax(dpL[i][num],sum);
		}
	}

	for(int i = N-1; 0 <= i; --i){
		ll sum = 0;
		int num = 0;
		V<ll> b;
		for(int j = N-1; i <= j && num < K; --j){
			num++;
			sum += a[j];
			chmax(dpR[i][num],sum);
			if(a[j]<0)b.push_back(a[j]);
		}
		sort(ALL(b));
		for(int j = 0; j < b.size() && num < K; ++j){
			num++;
			sum -= b[j];
			chmax(dpR[i][num],sum);
		}
	}

	for(int i = 0; i < N; ++i) for(int j = 1; j <= K; ++j) chmax(dpL[i][j],dpL[i][j-1]);
	for(int i = 0; i < N; ++i) for(int j = 1; j <= K; ++j) chmax(dpR[i][j],dpR[i][j-1]);

	ll ans = 0;
	for(int i = 0; i < N; ++i){
		for(int j = i+1; j < N; ++j){
			for(int k = 0; k <= K; ++k){
				chmax(ans,dpL[i][k]+dpR[j][K-k]);
			}
		}
	}
	cout << ans << endl;
    return 0;
}


Measured memory_bytes: 384