Problem:
Score : 900 points

Problem Statement

Takahashi has a lot of peculiar devices.
These cylindrical devices receive balls from left and right.
Each device is in one of the two states A and B, and for each state, the device operates as follows:

When a device in state A receives a ball from either side (left or right), the device throws out the ball from the same side, then immediately goes into state B.

When a device in state B receives a ball from either side, the device throws out the ball from the other side, then immediately goes into state A.

The transition of the state of a device happens momentarily and always completes before it receives another ball.

Takahashi built a contraption by concatenating N of these devices. In this contraption,

A ball that was thrown out from the right side of the i-th device from the left (1 \leq i \leq N-1) immediately enters the (i+1)-th device from the left side.

A ball that was thrown out from the left side of the i-th device from the left (2 \leq i \leq N) immediately enters the (i-1)-th device from the right side.

The initial state of the i-th device from the left is represented by the i-th character in a string S.
From this situation, Takahashi performed the following K times: put a ball into the leftmost device from the left side, then wait until the ball comes out of the contraption from either end.
Here, it can be proved that the ball always comes out of the contraption after a finite time.
Find the state of each device after K balls are processed.

Constraints

1 \leq N \leq 200,000

1 \leq K \leq 10^9

|S|=N

Each character in S is either A or B.

Input

The input is given from Standard Input in the following format:

N K
S

Output

Print a string that represents the state of each device after K balls are processed.
The string must be N characters long, and the i-th character must correspond to the state of the i-th device from the left.

Sample Input 1

5 1
ABAAA

Sample Output 1

BBAAA

In this input, we put a ball into the leftmost device from the left side, then it is returned from the same place.

Sample Input 2

5 2
ABAAA

Sample Output 2

ABBBA

Sample Input 3

4 123456789
AABB

Sample Output 3

BABA

Solution in Rust (1.15.1) (judge verdict: Accepted)

#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;
fn get_word() -> String {
    let mut stdin = std::io::stdin();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

// Written after the author read the editorial
fn solve() {
    let n: usize = get();
    let mut k: i64 = get();
    // A -> false, B -> true
    let mut s: Vec<bool> = get_word().chars().map(|x| x == 'B').collect();
    assert_eq!(s.len(), n);
    let mut pos = 0;
    for i in 0 .. n {
        s[i] = s[i] ^ ((n + i) % 2 != 1);
    }
    for _ in 0 .. n {
        s.push(false);
    }
    while k > 0 {
        if pos >= n {
            break;
        }
        if s[pos] ^ (n % 2 != 1) { // B
            pos += 1;
        } else { // A
            s[pos] = !s[pos];
        }
        k -= 1;
    }
    if k > 0 && n % 2 == 1 && k % 2 == 1 {
        assert_eq!(pos, n);
        s[n] = !s[n];
    }
    // recons
    let mut out = String::new();
    for i in 0 .. n {
        out.push(if s[pos + i] ^ ((n + i) % 2 != 1) { 'B' } else { 'A' });
    }
    println!("{}", out);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}