#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll inf = (1LL<<60);

int main() {
    int T;
    cin >> T;

    while(T){
        T--;

        string str,ptn;
        int x;
        cin >> str >> ptn >> x;

        int len = str.length();

        if(ptn == "Warong"){
            bool check = true;
            queue<int> que;

            for(int i=0;i<len;i++){
                if(i < x) str[i] = 'A';
                else{
                    if(str[i] == '?') que.push(i);
                    if(str[i] == 'W') check = false;
                }
            }

            if(que.size() == 1 && check){
                str[que.front()] = 'W';
            }

            cout << str << endl;
        }

        if(ptn == "NotWarong"){
            bool frontAllA = true,backwExist = false, frontwExist = false;
            queue<int>que;

            for(int i=0;i<x;i++){
                if(str[i] != 'A'){
                    frontAllA = false;

                    if(str[i] == 'W') frontwExist = true;
                    if(str[i] == '?') que.push(i);
                }
            }

            for(int i=x;i<len;i++){
                if(str[i] == 'W') backwExist = true;
            }

            if(frontAllA){
                string ans(len,'A');
                str = ans;
            }else if(!frontwExist && backwExist && que.size() == 1){
                str[que.front()] = 'W';
            }

            cout << str << endl;
        }
    }
}