#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;

void solve() {
    string R, S;
    cin >> R >> S;
    ll K;
    cin >> K;

    ll len = R.size();
    if (S == "Warong") {
        for (int i = 0; i < K; i++) R[i] = 'A';
        ll q_cnt = 0;
        ll w_cnt = 0;
        for (int i = 0; i < len; i++) {
            if (R[i] == '?') q_cnt++;
            if (R[i] == 'W') w_cnt++;
        }
        if (w_cnt == 0 && q_cnt == 1) {
            for (int i = 0; i < len; i++) {
                if (R[i] == '?') R[i] = 'W';
            }
        }
    }
    else {
        bool all_a = true;
        for (int i = 0; i < K; i++) {
            if (R[i] != 'A') all_a = false;
        }
        if (all_a) {
            for (int i = 0; i < len; i++) R[i] = 'A';
        }
        bool w_exists = false;
        for (int i = K; i < len; i++) {
            if (R[i] == 'W') w_exists = true;
        }
        if (w_exists) {
            ll q_cnt = 0;
            ll w_cnt = 0;
            for (int i = 0; i < K; i++) {
                if (R[i] == '?') q_cnt++;
                if (R[i] == 'W') w_cnt++;
            }
            if (w_cnt == 0 && q_cnt == 1) {
                for (int i = 0; i < K; i++) {
                    if (R[i] == '?') R[i] = 'W';
                }
            }
        }
    }

    cout << R << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}