Sereja and Swaps

给一个长为 n 的序列，以及交换次数 k，每次可以在原先的序列 中任意交换两个数 交换后找一个最大子串和，输出其可能的最大值。 1 <= n <= 200; 1 <=k <=10

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) $ .

In a single line print the maximum value of $ m(a) $ that Sereja can get if he is allowed to perform at most $ k $ swap operations.

10 2
10 -1 2 2 2 2 2 2 -1 10

32

5 10
-1 -1 -1 -1 -1

-1