B'There is a deck of n cards, each card has one of k types. You are given the sequence a_1, a_2, ... , a_n denoting the types of cards in the deck from top to bottom. Both n and k are even numbers. You play a game with these cards. First, you draw k topmost cards from the deck. Then, the following happens each turn of the game: You have to calculate the maximum number of coins you can earn during the game. The first line of the input contains two integers n and k ( 2 <= k <= n <= 1000 , both n and k are even). The second line of the input contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= k ). Print one integer -- the maximum number of coins you can earn. '...