#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
using namespace std;
typedef long long ll; typedef long double ld;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>;  using vvl = vector<vl>;

string solve() {
	string R,S; cin>>R>>S;
	int K; cin>>K;
	int N = R.size();

	if(S != "Warong") {
		int W1cnt = 0, W2cnt = 0, Q1cnt = 0, Q2cnt = 0, Q1pos = -1, Q2pos = -1;
		rep(i,N) {
			if(R[i] == 'W') {
				if(i<K) W1cnt++;
				else    W2cnt++;
			}
			if(R[i] == '?') {
				if(i<K) Q1cnt++, Q1pos = i;
				else    Q2cnt++, Q2pos = i;
			}
		}

		if(W1cnt == 0 && Q1cnt == 0) { //左K個が全部'A'
			rep(i,N) R[i] = 'A';
		}
		else if(W1cnt == 0) { //左K個が'A'か'?'
			if(W2cnt > 0) {
				if(Q1cnt == 1) R[Q1pos] = 'X';
			}
			else if(W2cnt == 0) { //全体にわたって'A'か'?'
				if(Q1cnt == 1 && Q2cnt == 0) R[Q1pos] = 'X';
			} 
		}

		return R;
	}
	else {
		int Wcnt = 0, Qcnt = 0, Qpos = -1;
		rep(i,N) {
			if(i < K) R[i] = 'A';
			continue;

			if(R[i] == 'W') Wcnt++;
			if(R[i] == '?') Qcnt++, Qpos = i;
			if(Wcnt == 0 && Qcnt == 1) R[Qpos] = 'W';
		}
		return R;
	}
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0); //入出力高速化

	int T; cin>>T;
	rep(i,T) cout<<solve()<<'\n';
}