#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cassert>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < (int) b; i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
#define f first
#define s second
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};
void setIO(string nome) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen ((nome + ".in").c_str(), "r", stdin);
freopen ((nome + ".out").c_str(), "w", stdout);
}
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
string w;
cin >> w;
stack< pair<char, int> > cnt;
F0R (i, n) {
if (cnt.empty()) {
cnt.push({w[i], 1});
} else {
char last = cnt.top().f;
char cur = w[i];
int score_last = cnt.top().s;
if (last == cur) {
cnt.push({w[i], score_last + 1});
if (score_last + 1 == k) {
int to_remove = k;
while (to_remove--) {
cnt.pop();
}
}
} else {
cnt.push({w[i], 1});
}
}
}
string ans;
while (!cnt.empty()) {
ans += cnt.top().f;
cnt.pop();
}
reverse (all(ans));
cout << ans << '\n';
return 0;
}
