B'Alice and Bob play a game. They have a set that initially consists of n integers. The game is played in k turns. During each turn, the following events happen: Initially, the score is 0 . Alice wants to maximize the resulting score, Bob wants to minimize it. Assuming that both Alice and Bob play optimally, calculate the resulting score of the game. The first line contains two integers n and k ( 2 <= n <= 400 , 1 <= k <= lfloor frac{n}{2} rfloor ) -- the initial size of the set and the number of turns in the game. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^6 ) -- the initial contents of the set. These integers are pairwise distinct. Print one integer -- the resulting score of the game (assuming that both Alice and Bob play optimally). '...