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
/*
Keep solving problems.
*/

import java.util.*;
import java.io.*;

public class CFA {
    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    private static final long MOD = 1000 * 1000 * 1000 + 7;
    private static final int[] dx = {0, -1, 0, 1};
    private static final int[] dy = {1, 0, -1, 0};
    private static final String yes = "Yes";
    private static final String no = "No";

    class Node implements Comparable<Node> {
        int idx;
        char c;
        public Node(int idx, char c) {
            this.idx = idx;
            this.c = c;
        }

        @Override
        public int compareTo(Node o) {
            return Integer.compare(this.idx, o.idx);
        }

        @Override
        public String toString() {
            return idx + " " + c;
        }
    }
    void solve() throws IOException {
        int n = nextInt();
        int k = nextInt();
        List<List<Node>> hist = new ArrayList<>();
        int m = 26;
        for (int i = 0; i < m; i++) {
            hist.add(new ArrayList<>());
        }
        char[] arr = nextString().toCharArray();
        for (int i = 0; i < arr.length; i++) {
            hist.get(arr[i] - 'a').add(new Node(i, arr[i]));
        }

        if (k == n) {
            outln("");
            return;
        }

        int row = -1;
        int col = -1;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < hist.get(i).size(); j++) {
                if (k == 0) {
                    row = i;
                    col = j;
                    break;
                }

                k--;
            }
            if (k == 0) {
                if (row == -1) {
                    row = i + 1;
                    col = 0;
                }
                break;
            }
        }

        List<Node> res = new ArrayList<>();
        for (int j = col; j < hist.get(row).size(); j++) {
            Node cur = hist.get(row).get(j);
            res.add(cur);
        }
        for (int i = row + 1; i < m; i++) {
            res.addAll(hist.get(i));
        }

        Collections.sort(res);
        for (int i = 0; i < res.size(); i++) {
            out(res.get(i).c);
        }
    }

    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }

    long gcd(long a, long b) {
        while(a != 0 && b != 0) {
            long c = b;
            b = a % b;
            a = c;
        }
        return a + b;
    }

    private void outln(Object o) {
        out.println(o);
    }
    private void out(Object o) {
        out.print(o);
    }
    private void formatPrint(double val) {
        outln(String.format("%.9f%n", val));
    }
    public CFA() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new CFA();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}