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
#include <bits/stdc++.h>
using namespace std;
int n, k;
const int maxn = 5 * 1e5;
string s;
struct node {
  int num;
  int pos;
};
node a[maxn];
bool cmp(node a, node b) {
  if (a.num == b.num)
    return a.pos < b.pos;
  else
    return a.num < b.num;
}
int main() {
  cin >> n >> k;
  cin >> s;
  int len = s.size();
  for (int i = 0; i < len; i++) {
    a[i].num = s[i] - 'a' + 1;
    a[i].pos = i;
  }
  a[len].num = a[len].pos = 0x3f3f3f3f;
  sort(a, a + len, cmp);
  int t = a[k].num;
  int st = a[k].pos;
  for (int i = 0; i < len; i++) {
    int p = s[i] - 'a' + 1;
    if (p > t) cout << s[i];
    if (p == t && i >= st) cout << s[i];
  }
  cout << endl;
  return 0;
}
