import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}

	// ======================================================================
	int N, K;
	long[] V;
	TreeMap<Long, Integer> map = new TreeMap<>();
	long[][][] memo;
	long calc(int now, int l, int r) {
		if(now >= K || l > N-1 || r < 0)	return 0;
		if(memo[now][l][r] != -1)	return memo[now][l][r];
		long ans = 0;
		if(l <= r) {
			map.merge(V[l], 1, Integer::sum);
			ans = Math.max(ans, calc(now + 1, l + 1, r) + V[l]); 
			if(map.get(V[l]) == 1)	map.remove(V[l]);
			else					map.merge(V[l], -1, Integer::sum);
			map.merge(V[r], 1, Integer::sum);
			ans = Math.max(ans, calc(now + 1, l, r-1) + V[r]); 
			if(map.get(V[r]) == 1)	map.remove(V[r]);
			else					map.merge(V[r], -1, Integer::sum);
		}
//		if(!map.isEmpty()) {
//			out.println("=================================");
//			for(Long key : map.keySet()) {
//				out.println("key = " + key + " カウント " + map.get(key));
//			}
//		}
		Long key = (map.isEmpty() ? null : map.firstKey());
		if(key != null && key < 0 && map.get(key) > 0) {
			if(map.get(key) == 1)	map.remove(key);
			else					map.merge(key, -1, Integer::sum);
			ans = Math.max(ans, calc(now + 1, l, r) - key);
			map.merge(key, 1, Integer::sum);
		}
		// 何もしないで、処理回数を進める
		ans = Math.max(ans, calc(now + 1, l, r));

		return memo[now][l][r] = ans;
	}
	public void solve() {
		N = ni();
		K = ni();
		V = nl(N);
		memo = new long[K][N][N];
		for (int i = 0; i < K; i++) {
			for (int j = 0; j < N; j++) {
				Arrays.fill(memo[i][j], -1);
			}
		}
		out.println(calc(0,0,N-1));
	}

	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);

	// Scanner
	private FastScanner scan = new FastScanner();

	int ni() {
		return scan.nextInt();
	}

	int[] ni(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		return a;
	}

	int[][] ni(int y, int x) {
		int[][] a = new int[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ni();
			}
		}
		return a;
	}

	long nl() {
		return scan.nextLong();
	}

	long[] nl(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = nl();
		}
		return a;
	}

	long[][] nl(int y, int x) {
		long[][] a = new long[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = nl();
			}
		}
		return a;
	}

	String ns() {
		return scan.next();
	}

	String[] ns(int n) {
		String[] a = new String[n];
		for (int i = 0; i < n; i++) {
			a[i] = ns();
		}
		return a;
	}

	String[][] ns(int y, int x) {
		String[][] a = new String[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ns();
			}
		}
		return a;
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}


Measured memory_bytes: 47040