Lexicographically Largest Kth Occurence :
Difficulty Level : Medium
Submissions : 521
Asked In :
Marks :30
: 10 | : 0
Bob gave Alex a string $$$s$$$ consisting of lowercase English letters of length $$$n.$$$ He then asked Alex to construct a new string $$$s1$$$ using the characters of $$$s$$$ such that no two characters appear more than $$$k$$$ times consecutively. It is not mandatory to use all characters from $$$s.$$$
Help Alex find the lexicographically largest possible string $$$s1.$$$
Input
The first line contains two space-separated integers $$$n$$$ and $$$k$$$. The second line contains a string $$$s$$$ of length $$$n$$$.$$$(1 \le n \le 10^5).$$$$$$( 1\le k \le n.)$$$
Output
Output the lexicographically largest string.
Examples
Input
7 3 xxxxzza
Output
zzxxxax
Input
19 3 zzzzzzxxxzzaabbazza
Output
zzzxzzzxzzzxzbbaaa
Input
9 2 cledqiwly
Output
ywqlliedc
