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).
import sys
from array import array

input = lambda: sys.stdin.buffer.readline().decode().strip()
n, k = map(int, input().split())
a = array('i', [int(x) for x in input().split()])
ans = -10**9

for i in range(n):
    for j in range(i, n):
        su = sum(a[i:j + 1])
        seg = sorted(a[i:j + 1])
        rem = sorted(a[:i] + a[j + 1:])

        for _ in range(min(k, len(seg), len(rem))):
            su -= seg[_]
            su += rem.pop()
        ans = max(ans, su)

print(ans)
