#include <iostream>

#include <deque>
using namespace std;
deque<pair<char,int>> d;
char c;
int n,k,i;
int main()
{
cin>>n>>k;
for(i=0;i<n;i++)
{
cin>>c;
if(!d.empty()&&d.back().first==c)
{
d.back().second++;
if(d.back().second==k)
d.pop_back();
}
else d.push_back(make_pair(c,1));
}
while(!d.empty())
{
while(d.front().second--)
cout<<d.front().first;
d.pop_front();
}
return 0;
}