Digit K

　

At the Aizu Akabeko store, we sell a unique "lottery" called Digit K. Each lottery ticket has $N$ numbers in a row, going from left to right. The numbers written on them are from 1 to 9.

The purchaser of a lottery ticket can eliminate $K$ numbers from these numbers and earn points for the number of $N-K$ numbers remaining, arranged in order from left to right. For example, if $K=3$ and the lottery says 1414213, the player can choose 1, 1, and 2 from the left and eliminate them to earn 4413 points.

Given a sequence of numbers and an integer $K$, write a program that outputs the maximum number of points that can be earned.

Input

The input is given in the following form.

$N$ $K$
$a_1$ $a_2$ ... $a_N$

The first line gives the number of numbers $N$ ($1 \leq N \leq 200,000$) and the integer $K$ ($0 \leq K < N$). The second line gives $N$ numbers $a_i$ ($1 \leq a_i \leq 9$) written in the lottery.

Output

Output the maximum value of points in a line.

Sample Input and Output

Sample Input 1

7 3
1 4 1 4 2 1 3

Sample Output 1

4423

Sample Input 2

4 1
1 1 9 9

Sample Output 2

199

---