#include <bits/stdc++.h>
using namespace std;
int t[200001];
int main() {
  memset(t, 0x3f, sizeof(t));
  int n, k;
  string str;
  cin >> n >> k >> str;
  for (int x = 0; x < n; x++)
    if (str[x] == str[(x + 1) % n] || str[x] == str[(x - 1 + n) % n]) t[x] = 0;
  for (int x = 0; x < 2 * n; x++)
    t[x % n] = min(t[x % n], t[(x - 1 + n) % n] + 1);
  for (int x = 2 * n - 1; x >= 0; x--)
    t[x % n] = min(t[x % n], t[(x + 1) % n] + 1);
  for (int x = 0; x < n; x++)
    if (min(t[x], k) % 2) str[x] = 153 - str[x];
  cout << str << endl;
}
