from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

for _ in range(int(input())):
    R = list(input())
    S = input()
    K = int(input())
    N = len(R)
    if S == "NotWarong":
        if R[:K].count("A") == K:
            for i in range(N):
                if R[i] == "?": R[i] = "A"
        if R[K:].count("W") > 0:
            if R[:K].count("A") == K-1 and R[:K].count("?") == 1:
                R[R.index("?")] = "W"
    else:
        for i in range(K):
            if R[i] == "?":
                R[i] = "A"
        if R[K:].count("?") == 1 and R[K:].count("W") == 0:
            R[R[K:].index("?")+K] = "W"
    printl(R, "")