#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main ()
{
long N, K;
cin>>N>>K;
stack <int> S;
for (long i=1; i<=N; i++)
{
char tmp_char;
cin>>tmp_char;
int tmp_int = tmp_char - '0';
if (S.empty())
{
S.push(tmp_int);
}
else
{
while (!S.empty() && tmp_int > S.top() && K>0)
{
S.pop();
K--;
}
S.push(tmp_int);
}
}
while (K>0 && !S.empty())
{
S.pop();
K--;
}
vector <int> smallest;
while (!S.empty())
{
int tmp=S.top();
S.pop();
smallest.push_back(tmp);
}
for (long i=smallest.size()-1; i>=0; i--)
cout<<smallest[i];
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RhY2s+CiNpbmNsdWRlIDx2ZWN0b3I+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbiAoKQp7Cglsb25nIE4sIEs7CgljaW4+Pk4+Pks7CglzdGFjayA8aW50PiBTOwoJZm9yIChsb25nIGk9MTsgaTw9TjsgaSsrKQoJewoJCWNoYXIgdG1wX2NoYXI7CgkJY2luPj50bXBfY2hhcjsKCQlpbnQgdG1wX2ludCA9IHRtcF9jaGFyIC0gJzAnOwoJCWlmIChTLmVtcHR5KCkpCgkJewoJCQlTLnB1c2godG1wX2ludCk7CgkJfQoJCWVsc2UKCQl7CgkJCXdoaWxlICghUy5lbXB0eSgpICYmIHRtcF9pbnQgPiBTLnRvcCgpICYmIEs+MCkKCQkJewoJCQkJUy5wb3AoKTsKCQkJCUstLTsKCQkJfQoJCQlTLnB1c2godG1wX2ludCk7CgkJfQoJfQoJd2hpbGUgKEs+MCAmJiAhUy5lbXB0eSgpKQoJewoJCVMucG9wKCk7CgkJSy0tOwoJfQoJdmVjdG9yIDxpbnQ+IHNtYWxsZXN0OwoJd2hpbGUgKCFTLmVtcHR5KCkpCgl7CgkJaW50IHRtcD1TLnRvcCgpOwoJCVMucG9wKCk7CgkJc21hbGxlc3QucHVzaF9iYWNrKHRtcCk7Cgl9Cglmb3IgKGxvbmcgaT1zbWFsbGVzdC5zaXplKCktMTsgaT49MDsgaS0tKQoJCWNvdXQ8PHNtYWxsZXN0W2ldOwoJcmV0dXJuIDA7Cn0=