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

	static class pair implements Comparable<pair>
	{
		char c;
		int i;
		
		public int compareTo(pair p)
		{
			return this.c - p.c;
		}
	}
	static class sorting implements Comparator<pair>
	{
		public int compare(pair a,pair b)
		{
			return a.i-b.i;
		}
	}
	
	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();
		pair[] p = new pair[n];
		for (int i = 0; i < n; ++i) 
		{
			p[i]=new pair();
			p[i].c=s.charAt(i);
			p[i].i=i;
		}
		Arrays.sort(p);
		ArrayList<pair> al = new ArrayList();
		for(int i=k;i<n;i++)
			al.add(p[i]);
		Collections.sort(al,new sorting());
		for(int i=0;i<al.size();i++)
		{
			System.out.print(al.get(i).c);
		}
	}

}
