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).
n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
assert len(a) == n

best = a[0]
for l in range(n):
    for r in range(l+1,n):
        #cur = solve(a,l,r)
        out = sorted(a[:l]+a[r:])
        inside = sorted(a[l:r])
        swaps = min(len(inside),len(out),k)
        cur = sum(a[l:r])+sum(out[-swaps:])-sum(inside[:swaps])
        if cur > best:
            best = cur

print(best)
