CF999C.Alphabetic Removals

The first line of input contains two integers $n$ and $k$ ( $1 \le k \le n \le 4 \cdot 10^5$ ) — the length of the string and the number of letters Polycarp will remove.

The second line contains the string $s$ consisting of $n$ lowercase Latin letters.

Print the string that will be obtained from $s$ after Polycarp removes exactly $k$ letters using the above algorithm $k$ times.

If the resulting string is empty, print nothing. It is allowed to print nothing or an empty line (line break).

无