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.io.*;

public class C5
{
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		
		int n = in.nextInt();
		int k = in.nextInt();
		in.nextLine();
		String s = in.nextLine();
		int[] count = new int[26];
		char[] c = new char[n];
		int p=0;
		
		for(int i=0;i<n;i++)
		{
			c[i] = s.charAt(i);
			count[c[i]-'a']++;
		}
		//for(int i=0;i<26;i++)
			//System.out.print(count[i]+" ");
		for(int i=0;i<26;i++)
		{	
			for(int j=0;j<n;j++)
			{
				if(c[j]-'a'==i)
				{
					c[j] = '!';
					p++;
					//System.out.println(i+" "+"hii"+p);
					if(p==k)
						break;
				}
			}
			
			if(p==k)
				break;
		}
		
		for(int i=0;i<n;i++)
		{
			if(c[i]!='!')
				System.out.print(c[i]);
		}
	}

}
