#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
template <typename T>
T gcd(T m, T n) {
  while (n) {
    T t = m % n;
    m = n;
    n = t;
  };
  return m;
}
template <typename T>
T exgcd(T a, T b, T& sa, T& ta) {
  T q, r, sb = 0, tb = 1, sc, tc;
  sa = 1, ta = 0;
  if (b) do
      q = a / b, r = a - q * b, a = b, b = r, sc = sa - q * sb, sa = sb,
      sb = sc, tc = ta - q * tb, ta = tb, tb = tc;
    while (b);
  return a;
}
template <typename T>
T mul_inv(T a, T b) {
  T t1 = a, t2 = b, t3;
  T v1 = 1, v2 = 0, v3;
  T x;
  while (t2 != 1)
    x = t1 / t2, t3 = t1 - x * t2, v3 = v1 - x * v2, t1 = t2, t2 = t3, v1 = v2,
    v2 = v3;
  return (v2 + b) % b;
}
template <typename T>
T powmod(T a, T b, T MOD) {
  if (b < 0) return 0;
  T rv = 1;
  while (b) (b % 2) && (rv = (rv * a) % MOD), a = a * a % MOD, b /= 2;
  return rv;
}
template <long long n>
struct BitSize {
  enum { Size = BitSize<n / 2>::Size + 1 };
};
template <>
struct BitSize<0> {
  enum { Size = 1 };
};
template <>
struct BitSize<1> {
  enum { Size = 1 };
};
const int maxn = 4e5 + 7;
int n, k;
char s[maxn];
int main(int argc, char* argv[]) {
  std::cin.sync_with_stdio(false);
  std::cin.tie(nullptr);
  (cin >> n >> k >> s);
  {
    for (int c = 'a'; c <= 'z'; c++) {
      for (int i = 0; i < n; i++) {
        if (s[i] == c && k > 0) {
          s[i] = 0;
          k--;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      if (s[i]) putchar(s[i]);
    }
    printf("\n");
  }
  return 0;
}
