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.io.IOException; 
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*; 

public class Main 
{ 	

    private static Reader r; 	
	private static boolean flag[];

	public static void main(String[] args) 	throws Exception 	
	{ 	

		r = new Reader(); 		
		r.readLine(); 		

		int n = r.readInt(0);
		int k = r.readInt(1);

		flag = new boolean[n];

		r.readLine();
		char charArr[] =  r.readString(0).toCharArray();

		Map<Character,List<Integer>> freqIdx = getCharFreqWithIdx(charArr, n);

		for (char ch='a';ch <= 'z';++ch)
		{
			int size = 0;

			if (freqIdx.containsKey(ch))
				size = freqIdx.get(ch).size();
			else
				continue;

			if (size <= k)
				setCharAtIdxForEmpty(freqIdx, ch, size, charArr);
			else
				setCharAtIdxForEmpty(freqIdx, ch, k, charArr);
			k -= size;

			if (k <= 0)
				break;
		}

		printRes(charArr, n);
		r.close(); 
	}

	public static Map<Character,List<Integer>> getCharFreqWithIdx(char charArr[], int size)
	{
		Map<Character,List<Integer>> freqIdxs = new HashMap<>();

		int freq[] = new int[26];
		for (int i=0;i < size;++i)
		{
			int fr = ++freq[charArr[i] - 'a'];
			List<Integer> idx = new ArrayList<>();

			if (fr != 1)
				idx = freqIdxs.get(charArr[i]);
			else
				idx = new ArrayList<Integer>();

			idx.add(i);
			freqIdxs.put(charArr[i], idx);
		}

		return freqIdxs;
	}

	public static void setCharAtIdxForEmpty(Map<Character,List<Integer>> freqIdx, char ch, int num, char []charArr)
	{
		List<Integer> idx = freqIdx.get(ch);

		for (int i=0;i < num;++i)
		{
			/*charArr[idx.get(i)] = DEFAULT_CHAR_VALUE;*/
			flag[idx.get(i)] = true;
		}
	}

	private static void printRes(char []charArr, int size)
	{
		StringBuilder res = new StringBuilder();
		for (int i=0;i < size;++i)
			if (!flag[i])
				res.append(charArr[i]);


		System.out.println(res.toString());

	}

	public static List<Integer> getDivs(int n)
	{
		List<Integer> divs = new ArrayList<>();

		for (int i=1; i <= Math.sqrt(n); i++) 
		{ 
			if (n % i == 0) 
			{ 
				if (n / i == i) 
					divs.add(i);
				else  
				{
					divs.add(i);
					divs.add(n / i);
				}
			} 
		} 
		return divs;
	}

	public static void reverseOrSwap(char arr[], int fr, int to)
	{
		int step = (to - fr) / 2;
		for (int i=0;i <= step;++i)
		{
			char temp = arr[i];
			arr[i] = arr[to - i];
			arr[to - i] = temp;
		}
	}

} 

class Pair implements Comparable<Pair>
{ 	
	int f,s; 	
	public Pair() 	
	{} 
	public Pair(int f, int s) 	
	{ 	
		this.f = f; 	
		this.s = s; 	
	} 

	@Override 	
	public String toString() 
	{ 		
		return f + " " + s; 	
	} 	

	@Override 	
	public int compareTo(Pair o) 	
	{ 		
		// TODO: Implement this method 		
		if (f == o.f) 			
			return s - o.s; 		
		return f - o.f; 	
	} 
}

class Reader
{ 	
	private BufferedReader reader; 
	private String line[]; 	

	public Reader() 	
	{ 		
		reader = new BufferedReader(new InputStreamReader(System.in)); 	
	} 	

	public String[] getLine() 	
	{ 		
		return line; 	
	} 	

	public void readLine() 	throws IOException 
	{ 		
		line = reader.readLine().split(" "); 	
	} 	

	public int readInt(int pos)throws IOException 	
	{ 		
		return Integer.parseInt(line[pos]); 	
	} 	

	public double readDouble(int pos)throws IOException 	
	{ 		
		return Double.parseDouble(line[pos]); 	
	} 	

	public long readLong(int pos)throws IOException 
	{ 		
		return Long.parseLong(line[pos]); 
	} 	

	public String readString(int pos)throws IOException 	
	{ 		
		return line[pos]; 	
	} 	

	public void close()throws IOException 
	{ 		
		reader.close(); 	
	}

}