#include <bits/stdc++.h>
using namespace std;
const long long big = 1000000007;
const long long mod = 998244353;
long long n, m, k, q, T;
vector<long long> ind;
string s;
bool mark[1000000] = {0};
bool comp(long long i, long long j) {
  if (s[i] == s[j]) return i < j;
  return s[i] < s[j];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, c, d;
  cin >> n >> k;
  cin >> s;
  for (int c1 = 0; c1 < n; c1++) ind.push_back(c1);
  sort(ind.begin(), ind.end(), comp);
  for (int c1 = 0; c1 < k; c1++) {
    mark[ind[c1]] = 1;
  }
  for (int c1 = 0; c1 < n; c1++) {
    if (!mark[c1]) cout << s[c1];
  }
  return 0;
}
