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 Solution {
	static FastScanner scr=new FastScanner();
	static PrintStream out=new PrintStream(System.out);
	static StringBuilder sb=new StringBuilder();
	
	static int gcd(int a,int b){
		if(b==0) {
			return a;
		}
			
		return gcd(b,a%b);
	}
	static void print(int ele) {
		sb.append(ele).append(" ");
	}
	static void println(int ele) {
//		AccessBridge.
		sb.append(ele).append('\n');
		
	}
	static void println() {
		sb.append('\n');
	}
	static long modPow(long base,long exp,long mod) {
		if(exp==0) {
			return 1;
		}
		if(exp%2==0) {
			long res=(modPow(base,exp/2,mod));
			return (res*res)%mod;
		}
		return (base*modPow(base,exp-1,mod))%mod;
	}
	static class pair{
		int x;int y;
		pair(int x,int y){ 
			this.x=x;this.y=y;
			
		}
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
	 	String next() {
	 		while (!st.hasMoreTokens())
	 			try {
	 				st=new StringTokenizer(br.readLine());
	 			} catch (IOException e) {
	 				e.printStackTrace();
	 			}
	 			return st.nextToken();
		}
	 	  int[]  sort(int a[]) {
			 
	        int multiplier = 1, len = a.length, max = Integer.MIN_VALUE;
	        int b[] = new int[len];
	        int bucket[];
	        for (int i = 0; i < len; i++) if (max < a[i]) max = a[i];
	        while (max / multiplier > 0) {
	            bucket = new int[10];
	            for (int i = 0; i < len; i++) bucket[(a[i] / multiplier) % 10]++;
	            for (int i = 1; i < 10; i++) bucket[i] += (bucket[i - 1]);
	            for (int i = len - 1; i >= 0; i--) b[--bucket[(a[i] / multiplier) % 10]] = a[i];
	            for (int i = 0; i < len; i++) a[i] = b[i];
	            multiplier *= 10;
	        }
	        return a;
	    }
		int []reverse(int a[]){
			int b[]=new int[a.length];
			int index=0;
			for(int i=a.length-1;i>=0;i--) {
				b[index]=a[i];
			}
			return b;
		}
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long[] readLongArray(int n) {
			long  [] a=new long  [n];
			for (int i=0; i<n; i++) a[i]=nextLong();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
	
	static void solve() {
		int n=scr.nextInt();
		int k=scr.nextInt();
		char c[]=scr.next().toCharArray();
		int count[]=new int[26];
		for(int i=0;i<n;i++) {
			count[c[i]-'a']++;
		}
		
		for(int i=0;i<26;i++) {
			int min=Math.min(k,count[i]);
//			out.println(min);
			count[i]-=min;
			k-=min;
		}
		String s="";
		StringBuilder sb=new StringBuilder();
		for(int i=n-1;i>=0;i--) {
			if(count[c[i]-'a']>0) {
//				s+=c[i];
				sb.append(c[i]);
				count[c[i]-'a']--;
			}
		}
		sb.reverse();
		out.println(sb);
	}
	static int  MAX=Integer.MAX_VALUE;
	static int  MIN=Integer.MIN_VALUE;
	public static void main(String []args) {
//		int t=scr.nextInt();
//		while(t-->0) {
			solve();
//		}
		out.println(sb);
	}
}
