Alphabetic Removals CodeForces - 999C

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

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
char a[500000];//97 122
int num[150];
int vis[500000];
int main()
{
    int n,m,i,j;
    cin>>n>>m;
    scanf("%s",a+1);
    memset(vis,0,sizeof(vis));
    memset(num,0,sizeof(num));
    for(i=1;i<=n;i++)
    {
        num[a[i]]++;
    }
    for(i=97;i<=122;i++)
    {
        //printf("%d ",num[i]);
        if(num[i] <= m)
        {
            m -= num[i];
            num[i] = 0;
        }
        else
        {
            num[i] -= m;
            break;
        }

    }
    for(i=n;i>=1;i--)
    {
        if(num[a[i]])
        {
            vis[i] = 1;
            num[a[i]]--;
        }
    }
    for(i=1;i<=n;i++)
    {
        if(vis[i])
            printf("%c",a[i]);
    }
    return 0;
}