#include <bits/stdc++.h>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define rFor(i,t,s) for (int i = (t); i >= (s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,inf,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}
 
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "\n";
    return out;
}

inline int gc(){
	static const int BUF = 1e7;
	static char buf[BUF], *bg = buf + BUF, *ed = bg;
	
	if(bg == ed) fread(bg = buf, 1, BUF, stdin);
	return *bg++;
} 

inline int ri(){
	int x = 0, f = 1, c = gc();
	for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
	for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
	return x*f;
}
 
typedef long long LL;
typedef unsigned long long uLL;
typedef pair< double, double > PDD;
typedef pair< int, int > PII;
typedef pair< string, int > PSI;
typedef set< int > SI;
typedef vector< int > VI;
typedef vector< PII > VPII;
typedef map< int, int > MII;
typedef pair< LL, LL > PLL;
typedef vector< LL > VL;
typedef vector< VL > VVL;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-10;
const LL inf = 0x7fffffff;
const LL infLL = 0x7fffffffffffffffLL;
const LL mod = 1e9 + 7;
const int maxN = 2e5 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;


int N, K, V[57];
// dp[L][R][x][k]表示从在区间[L, R]中，在 x 边进行操作（1表示右边，0表示左边），进行 k 此操作所能取到的最大值 
int dp[57][57][2][107];

inline int dfs(int L, int R, int x, int k) {
	if(L > R || k <= 0) return 0;
	if(dp[L][R][x][k]) return dp[L][R][x][k];
	int ret = 0;
	if(x == 0) {
		// left 
		ret = max(ret, V[L] + dfs(L + 1, R, 0, k - 1));
		ret = max(ret, V[L] + dfs(L + 1, R, 1, k - 1));
		if(V[L] < 0) {
			ret = max(ret, dfs(L + 1, R, 0, k - 2));
			ret = max(ret, dfs(L + 1, R, 1, k - 2));
		}
	}
	else {
		// right 
		ret = max(ret, V[R] + dfs(L, R - 1, 0, k - 1));
		ret = max(ret, V[R] + dfs(L, R - 1, 1, k - 1));
		if(V[R] < 0) {
			ret = max(ret, dfs(L, R - 1, 0, k - 2));
			ret = max(ret, dfs(L, R - 1, 1, k - 2));
		}
	}
	dp[L][R][x][k] = ret;
	return ret;
}

int main(){
	INIT(); 
	cin >> N >> K;
	For(i, 1, N) cin >> V[i];
	
	//cout << max(dfs(1, N, 0, K), dfs(1, N, 1, K)) << endl;
	
	For(k, 1, K) {
		For(L, 1, N) {
			For(R, L, N) {
				if(k != 1)dp[L][R][0][k] = max(dp[L + 1][R][0][k - 2], dp[L + 1][R][1][k - 2]);
				dp[L][R][0][k] = max(dp[L][R][0][k], V[L] + dp[L + 1][R][0][k - 1]);
				dp[L][R][0][k] = max(dp[L][R][0][k], V[L] + dp[L + 1][R][1][k - 1]);
				
				if(k != 1)dp[L][R][1][k] = max(dp[L][R - 1][0][k - 2], dp[L][R - 1][1][k - 2]);
				dp[L][R][1][k] = max(dp[L][R][1][k], V[R] + dp[L][R - 1][0][k - 1]);
				dp[L][R][1][k] = max(dp[L][R][1][k], V[R] + dp[L][R - 1][1][k - 1]);
			}
		}
	}
	cout << max(dp[1][N][0][K], dp[1][N][1][K]) << endl;
    return 0;
}

Measured memory_bytes: 1536