As usual, Sereja has array *a*, its elements are integers: *a*[1], *a*[2], ..., *a*[*n*]. Let's introduce notation:

A swap operation is the following sequence of actions:
 -  choose two indexes *i*, *j* (*i* ≠ *j*); -  perform assignments *tmp* = *a*[*i*], *a*[*i*] = *a*[*j*], *a*[*j*] = *tmp*. 
What maximum value of function *m*(*a*) can Sereja get if he is allowed to perform at most *k* swap operations?
The first line contains two integers *n* and *k* (1 ≤ *n* ≤ 200; 1 ≤ *k* ≤ 10). The next line contains *n* integers *a*[1], *a*[2], ..., *a*[*n*] ( - 1000 ≤ *a*[*i*] ≤ 1000).
#!/usr/local/bin/python3
n, k = map(int, input().split())
a = list(map(int, input().split()))
r_sum = a[0]
for l in range(n):
	for r in range(l, n):
		inside = sorted(a[l:r+1])
		outside = sorted(a[:l] + a[r+1:], reverse=True)
		t_sum = sum(inside)
		for i in range(min(k, len(inside), len(outside))):
			if outside[i] > inside[i]:
				t_sum += (outside[i] - inside[i])
			else:
				break
		if t_sum > r_sum:
			r_sum = t_sum
print(r_sum)
