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;
long long n, k;
void solve() {
  string a, ans;
  cin >> a;
  long long i, j, l = a.length(), b[26];
  for (i = 0; i < 26; i++) b[i] = 0;
  for (i = 0; i < l; i++) b[a[i] - 'a']++;
  for (i = 0; i < 26; i++) {
    if (k <= 0) break;
    if (k >= b[i]) {
      k -= b[i];
      b[i] = 0;
    } else {
      b[i] -= k;
      break;
    }
  }
  for (i = l - 1; i >= 0; i--)
    if (b[a[i] - 'a']) {
      ans.push_back(a[i]);
      b[a[i] - 'a']--;
    }
  l = ans.length();
  for (i = 0; i < l / 2; i++) {
    char ch = ans[i];
    ans[i] = ans[l - 1 - i];
    ans[l - 1 - i] = ch;
  }
  cout << ans << endl;
}
int main() {
  while (cin >> n >> k) solve();
}
