C - Alphabetic Removals

You are given a string s consisting of n lowercase Latin letters. Polycarp wants to remove exactly k characters ( k≤n) from the string s. Polycarp uses the following algorithm k

times:

• if there is at least one letter 'a', remove the leftmost occurrence and stop the algorithm, otherwise go to next item;
• if there is at least one letter 'b', remove the leftmost occurrence and stop the algorithm, otherwise go to next item;
• ...
• remove the leftmost occurrence of the letter 'z' and stop the algorithm.

This algorithm removes a single letter from the string. Polycarp performs this algorithm exactly k

times, thus removing exactly k

characters.

Help Polycarp find the resulting string.

Input

The first line of input contains two integers n

and k ( 1≤k≤n≤4⋅105

) — 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.

Output

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).

Examples

Input

15 3
cccaabababaccbc

Output

cccbbabaccbc

Input

15 9
cccaabababaccbc

Output

cccccc

Input

1 1
u

Output

AC代码（把每一种字母的个数统计下来，然后看k个是到第几个字母这个遍历的时候i代表的是第几个字母所以不能遍历到n

因为这个错了三次，卡在了第22组数据上）

#include <iostream>
#include <bits/stdc++.h>
#include <string.h>
using namespace std;

int main()
{
    int n, k, a[30], i, h = 0;
    char s[400000+10];
    memset(a, 0, sizeof(a));
    cin>>n>>k>>s;
    if(k<n)
 {
     for(i = 0;i<n;i++)
    {
     a[s[i]-'a']++;
    }
    for(i = 0;i<27;i++)
    {
     if(k-a[i]<=0)
     {
      h = i;
      break;
     }
     else
     k = k-a[i];
    }
    for(i = 0;i<n;i++)
    {
     if((s[i]-'a')<h)
     s[i]='#';
     else if((s[i]-'a')==h&&k>0)
     {
      s[i] = '#';
      k--;
     }
    }
    for(i = 0;i<n;i++)
    {
     if(s[i]!='#')
     printf("%c",s[i]);
    }
    printf("\n");
 }
 else
 printf("\n");
    return 0;
}