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;
struct trio {
  int64_t first, second, trd;
  friend ostream &operator<<(ostream &o, trio &a) {
    o << "(" << a.first << "," << a.second << "," << a.trd << ")";
    return o;
  }
};
template <typename T>
inline T max() {
  return numeric_limits<T>::max();
}
template <typename T>
inline T gcd(T a, T b) {
  return b == 0 ? a : gcd(b, a % b);
}
template <typename T>
inline void get(T &&v) {
  cin >> v;
}
template <typename T, typename... Args>
inline void get(T &&v, Args &&...args) {
  cin >> v;
  get(args...);
}
template <typename T>
inline void put(T &&v) {
  cout << v << '\n';
}
template <typename T, typename... Args>
inline void put(T &&v, Args &&...args) {
  cout << v << ' ';
  put(args...);
}
template <typename T>
inline void getc(T &&a) {
  for (auto &v : a) cin >> v;
}
template <typename T>
inline void putc(T &&a, const string s = " ") {
  {
    for (auto &v : a) cout << v << s;
  }
  cout << '\n';
}
template <typename T>
inline void putcr(T &&a, const string s = " ") {
  {
    for (int64_t i = a.size() - 1; i >= 0; --i) cout << a[i] << s;
  }
  cout << '\n';
}
int64_t mod = 1e9 + 7;
inline int64_t fpow(int64_t a, int64_t n) {
  int64_t r = 1;
  while (n) {
    if (n & 1) r = r * a;
    a = a * a;
    n >>= 1;
  }
  return r;
}
inline int64_t mpow(int64_t a, int64_t n) {
  int64_t r = 1;
  while (n) {
    if (n & 1) r = (r * a) % mod;
    a = (a * a) % mod;
    n >>= 1;
  }
  return r;
}
inline int64_t mul(int64_t a, int64_t n) {
  assert(n >= 0);
  int64_t r = 0;
  while (n) {
    if (n & 1) r = (r + a) % mod;
    a = (a + a) % mod;
    n >>= 1;
  }
  return r;
}
inline int64_t bpow(int64_t a, int64_t n) {
  int64_t r = 1;
  while (n) {
    if (n & 1) r = mul(r, a);
    a = mul(a, a);
    n >>= 1;
  }
  return r;
}
ostream &operator<<(ostream &out, pair<int32_t, int32_t> &a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
ostream &operator<<(ostream &out, pair<int64_t, int64_t> &a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
vector<int32_t> primes;
inline void calc_primes(int32_t lmt) {
  vector<char> s(lmt);
  primes.push_back(2);
  for (int32_t i = 3; i < lmt; i += 2) {
    if (s[i]) continue;
    primes.push_back(i);
    for (int32_t j = i + (i << 1); j < lmt; j += (i << 1)) s[j] = 1;
  }
}
inline vector<pair<int32_t, int32_t> > factorize(int32_t n) {
  vector<pair<int32_t, int32_t> > a;
  int32_t cnt = __builtin_ctzl(n);
  a.push_back({2, cnt});
  n >>= cnt;
  for (auto &d : primes) {
    cnt = 0;
    while (n % d == 0) n /= d, cnt++;
    a.push_back({d, cnt});
    if (n == 1) break;
  }
  if (n != 1) a.push_back({n, 1});
  return a;
}
int main() {
  {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << setprecision(20);
  };
  int64_t n, k;
  get(n, k);
  string s;
  get(s);
  vector<int32_t> a(30, 0);
  for (auto &c : s) a[c - 'a']++;
  for (int64_t i = 0; i < 30; ++i)
    if (a[i] < k) {
      k -= a[i];
      a[i] = 0;
    } else {
      a[i] -= k;
      k = 0;
      break;
    }
  vector<char> b;
  for (int64_t i = n - 1; i >= 0; --i)
    if (a[s[i] - 'a']-- > 0) b.push_back(s[i]);
  if (b.size() > 0)
    putcr(b, "");
  else
    cout << endl;
  return 0;
}
