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

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
import java.util.*;
public class B{

	public static void main(String[] args)
	{
            Scanner sc=new Scanner(System.in);
            int n=sc.nextInt();
            int k=sc.nextInt();
            sc.nextLine();
            String s=sc.nextLine();
            char a[]=s.toCharArray();
           // System.out.println(a.length);
            int c=0;
            for(int i=97;i<=122;i++)
            {
                for(int j=0;j<n;j++)
                {
                    //System.out.println(a[j]);
                    if(a[j]==i)
                    {
                        a[j]=1;
                        k--;
                    }
                    if(k==0)
                    break;
                }
                if(k==0)
                break;
             }
            // for(int i=0;i<n;i++)
           //  {
             //    if(a[i]==1)
            //     c++;
            // }
            // if(c==a.length)
            // System.out.println();
            // else
            // {
            for(int i=0;i<n;i++)
            {
                 if(a[i]!=1)
                 System.out.print((char)a[i]);
             }
            // }
	}
}
