#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <sstream>
#include <assert.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(bool x) {cerr << (x ? "true" : "false");}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}

template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";}
template <typename T, typename... V>void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef HOME
#warning CHECK int:ll::INT_MAX:LLONG_MAX
#define maxn 20
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define maxn 2000006
#define gcd __gcd
#define debug(x...)
#endif

#define ff first
#define endl '\n'
#define ss second
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define PI 3.14159265358979323846264338327950L
#define f(i,x,n) for(int i=x;i<=n;i++)
#define fr(i,x,n) for(int i=x;i>=n;i--)
struct _ { ios_base::Init i; _() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); } } _;

int dx[] = { -1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};


int main() {

	long long n, k; cin >> n >> k;
	vector<long long> v(n); for (long long i = 0; i <= n - 1; i++) cin >> v[i];
	v.push_back(0);

	auto solve = [&](vector<long long> dq) -> long long {

		long long in_hand = 0, res = 0;
		priority_queue<long long, vector<long long>, greater<long long>> pq;

		for (long long i = 0; i <= min((long long)dq.size(), k) - 1; i++) {
			in_hand += dq[i];
			if (dq[i] < 0) pq.push(dq[i]);

			long long temp_in_hand = in_hand;
			priority_queue<long long, vector<long long>, greater<long long>> temp_pq = pq;

			for (long long j = (long long)dq.size() - 1; j >= 0; j--) {
				if ((i + (long long)dq.size() - j > k) or i >= j) break;
				temp_in_hand += dq[j];
				if (dq[j] < 0) temp_pq.push(dq[j]);
				// debug(i, j, temp_in_hand);

				long long temp_temp_in_hand = temp_in_hand, cnt = i + (long long)dq.size() - j;
				priority_queue<long long, vector<long long>, greater<long long>> temp_temp_pq = temp_pq;

				while (!temp_temp_pq.empty() and cnt < k) {
					temp_temp_in_hand -= temp_temp_pq.top();
					temp_temp_pq.pop();
					cnt++;
				}


				res = max(res, temp_temp_in_hand);
			}
		}

		return res;

	};

	long long q1 = solve(v);
	// debug(q1);
	cout << q1;

	return 0;
}

Measured memory_bytes: 3164