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.BufferedWriter;
    import java.io.IOException;
    import java.io.InputStream;
    import java.io.OutputStream;
    import java.io.OutputStreamWriter;
    import java.io.PrintWriter;
    import java.io.Writer;
    import java.util.Arrays;
    import java.util.InputMismatchException;
    import java.util.*;
    import java.io.*;
    import java.math.*;
    public class Main
    {
        
        public static long pow(long a, long b)
        {
            long result=1;
            while(b>0)
            {
                if (b % 2 != 0)
                {
                    result=(result*a);
                    b--;
                } 
                a=(a*a);
                b /= 2;
            }   
            return result;
        }
        public static BigInteger fact(long num)
        {
            BigInteger fact=new BigInteger("1");
            int i=0;
            for(i=1; i<=num; i++)
            {
                BigInteger bg=BigInteger.valueOf(i);
                fact=fact.multiply(bg);
            }
            return fact;
        }
        public static long gcd(long a, long b)
        {
            if (a == 0)
                return b;
            return gcd(b%a, a);
        }
        
        public static long lcm(int a,int b)
        {
            return a * (b / gcd(a, b));
        }
        public static long sum(int h)
        {
            return (h*(h+1)/2);
        }
        public static void main(String args[])throws IOException
        {
            InputReader in=new InputReader(System.in);
    		OutputWriter out=new OutputWriter(System.out);
    	//	long a=pow(26,1000000005);
    	//    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    	    int n=in.readInt();
    	    int k=in.readInt();
    	    String s=in.readString();
    	    char[] ch=s.toCharArray();
    	    int count[]=new int[27];
    	    for(int i=0;i<n;i++)
    	    {
    	        count[ch[i]-'a']++;
    	    }
    	    int q=0;
    	    long sum=0;
    	    while(k>sum)
    	    {
    	        sum=sum+count[q];
    	        q++;
    	    }
    	    ArrayList<Character> ar=new ArrayList<Character>();
    	    if(q==1)
    	    {
    	        int r=0,count2=0;
    	        char[] ch4=new char[n];
    	        for(int i=0;i<n;i++)
    	        {
    	            if(ch[i]-'a'==q-1 && count2<k)
    	            {
    	                count2++;
    	            }
    	            else
    	            {
    	                ch4[r]=ch[i];
    	                r++;
    	            }
    	        }
    	        String s5=new String(ch4,0,r);
    	        System.out.println(s5);
    	    }
    	    else{
    	    if(k==sum)
    	    {
    	        for(int i=0;i<n;i++)
    	        {
    	            if((ch[i]-'a')>q-1)
    	            {
    	                System.out.print(ch[i]);
    	            }
    	        }
    	        System.out.println();
    	    }
    	    else
    	    {
    	        int p=0,w=0;
    	        char[] ch1=new char[n];
    	        for(int i=0;i<n;i++)
    	        {
    	            if((ch[i]-'a')<=q-2)
    	            {
    	                        
    	            }
    	            else
    	            {
    	                ch1[p]=ch[i];
    	           //     System.out.print(ch1[p]);
    	                p++;
    	            }
    	        }
    	        System.out.println();
    	        int count1=0;
    	        char[] ch2=new char[n];
    	        for(int i=0;i<p;i++)
    	        {
    	            if((ch1[i]-'a')==q-1 && count1<(k-(n-p)))
    	            {
    	                count1++;
    	            }
    	            else
    	            {
    	                ch2[w]=ch1[i];
    	                w++;
    	            }
    	        }
    	        String s3=new String(ch2,0,w);
    	        System.out.println(s3);
    	    }}
        }
    }
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
    class InputReader {
    	 
    	private InputStream stream;
    	private byte[] buf = new byte[1024];
    	private int curChar;
    	private int numChars;
    	private SpaceCharFilter filter;
     
    	public InputReader(InputStream stream) {
    		this.stream = stream;
    	}
     
    	public int read() {
    		if (numChars== -1)
    			throw new InputMismatchException();
    		if (curChar >= numChars) {
    			curChar = 0;
    			try {
    				numChars = stream.read(buf);
    			} catch (IOException e) {
    				throw new InputMismatchException();
    			}
    			if (numChars <= 0)
    				return -1;
    		}
    		return buf[curChar++];
    	}
     
    	public int readInt() {
    		int c = read();
    		while (isSpaceChar(c))
    			c = read();
    		int sgn = 1;
    		if (c == '-') {
    			sgn = -1;
    			c = read();
    		}
    		int res = 0;
    		do {
    			if (c < '0' || c > '9')
    				throw new InputMismatchException();
    			res *= 10;
    			res += c - '0';
    			c = read();
    		} while (!isSpaceChar(c));
    		return res * sgn;
    	}
     
    	public String readString() {
    		int c = read();
    		while (isSpaceChar(c))
    			c = read();
    		StringBuilder res = new StringBuilder();
    		do {
    			res.appendCodePoint(c);
    			c = read();
    		} while (!isSpaceChar(c));
    		return res.toString();
    	}
     
    	public boolean isSpaceChar(int c) {
    		if (filter != null)
    			return filter.isSpaceChar(c);
    		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    	}
     
    	public String next() {
    		return readString();
    	}
     
    	public interface SpaceCharFilter {
    		public boolean isSpaceChar(int ch);
    	}
    }
     
    class OutputWriter {
    	private final PrintWriter writer;
     
    	public OutputWriter(OutputStream outputStream) {
    		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    	}
     
    	public OutputWriter(Writer writer) {
    		this.writer = new PrintWriter(writer);
    	}
     
    	public void print(Object...objects) {
    		for (int i = 0; i < objects.length; i++) {
    			if (i != 0)
    				writer.print(' ');
    			writer.print(objects[i]);
    		}
    	}
     
    	public void printLine(Object...objects) {
    		print(objects);
    		writer.println();
    	}
     
    	public void close() {
    		writer.close();
    	}
     
    	public void flush() {
    		writer.flush();
    	}
     
    	}
     
        class IOUtils {
     
    	public static int[] readIntArray(InputReader in, int size) {
    		int[] array = new int[size];
    		for (int i = 0; i < size; i++)
    			array[i] = in.readInt();
    		return array;
    	}
     
    	}    
