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 CF490C {
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int k=sc.nextInt();
        String str=sc.next();
        if(n==k){
            System.out.println("");
            return;
        }
        int[] hash=new int[26];
        char ans[]=new char[n-k];
        for(int i=0;i<n;i++)
            hash[str.charAt(i)-97]++;
        int ele=0;
        for(int i=0;i<26;i++){
            if(k>=hash[i] && k>0){
                k-=hash[i];
                hash[i]=0;
            }
            else if(k>0){
                    hash[i]-=k;
                    ele=i;
                    break;
            }
            if(k==0){
                ele=i;
                break;
            }
        }
        //System.out.println(ele); //+" "+hash[1]+" "+hash[2]+" "+hash[3]);
       // System.out.println("size of ans is " + ans.length);
        int j=0;
        for(int i=0;i<n;i++){
            if(str.charAt(i)>97+ele){
                ans[j++]=str.charAt(i);
            }
            else if(str.charAt(i)==97+ele){
                if(k>0){
                    k--;
                }
                else if(hash[ele]-->0){
                    ans[j++]=str.charAt(i);
                }
            }
        }
        String abc=new String(ans);
        System.out.println(abc);
    }
}