#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        string r,s;
        int k;
        cin >> r >> s >> k;
        int n = r.size();
        if(s[0]=='W'){
            rep(i,k) r[i] = 'A';
            bool p = false;
            int cnt = 0;
            for(int i=k;i<n;++i){
                if(r[i]=='W') p = true;
                cnt += (r[i]=='?');
            }
            if(!p&&cnt==1){
                for(int i=k;i<n;++i){
                    if(r[i]=='?') r[i] = 'W';
                }
            }
        }else{
            bool p = false;
            int cnt = 0;
            for(int i=0;i<k;++i){
                if(r[i]=='W') p = true;
                cnt += (r[i]=='?');
            }
            if(!p&&!cnt){
                rep(i,n) r[i] = 'A';
            }
        }
        cout << r << '\n';
    }
    return 0;
}