// No.080639011920
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <deque>
#define N 200005
using namespace std;

int n;
char s[N];
deque<int> q;

void print() {
    for (int i = 1; i <= n; ++i)
        q.push_back(q.front()), cout << char('A' + (q.front())), q.pop_front();
    cout << endl;
}

int main() {
#ifdef LOCAL_JUDGE
    freopen(".in", "r", stdin);
    freopen(".out", "w", stdout);
#endif

    int K;
    cin >> n >> K;
    scanf("%s", s + 1);


    for (int i = 1; i <= n; ++i)
        q.push_back((s[i] - 'A') ^ (i % 2 == 0));

    //print();

    K = min(K, n * 2 + K % 2);

    for (int i = 1; i <= K; ++i) {
        //print();
        int u = q.front(); q.pop_front();
        if (!u) q.push_front(1);
        else q.push_back((n % 2 == 0));
    }

    for (int i = 1; i <= n; ++i)
        putchar('A' + (q.front() ^ (i % 2 == 0))), q.pop_front();

    return 0;
}
