#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve()
{
  string r, s;
  cin >> r >> s;
  int k;
  cin >> k;
  {
    int flag = 0;
    for (auto c : r) if (c == '?') flag = 1;
    if (flag == 0)
    {
      cout << r << endl;
      return;
    }
  }
  if (s == "Warong")
  {
    swap(r, s);
    for (int i = 0; i < k; ++i) s[i] = 'A';
    vector<int> id;
    int cntw = 0;
    int n = s.size();
    for (int i = 0; i < n; ++i)
    {
      if (s[i] == '?') id.push_back(i);
      else if (s[i] == 'W') ++cntw;
    }
    if (cntw == 0 && id.size() == 1) s[id[0]] = 'W';
  }
  else
  {
    swap(r, s);
    int flag = 1;
    for (int i = 0; i < k; ++i) if (s[i] != 'A') flag = 0;
    if (flag) for (int i = 0; i < s.size(); ++i) s[i] = 'A';
    else
    {
      for (int i = 0; i < k; ++i)
      {
        if (s[i] == 'W')
        {
          flag = 1;
          break;
        }
      }
      if (flag == 0)
      {
        flag = 0;
        for (int i = k; i < s.size(); ++i) if (s[i] == 'W') flag = 1;
        if (flag)
        {
          int cnt = 0;
          for (int i = 0; i < k; ++i) cnt += s[i] == '?';
          if (cnt == 1)
          {
            for (int i = 0; i < k; ++i) if (s[i] == '?') s[i] = 'W';
          }
        }
      }
    }
  }
  cout << s << endl;
}

int main()
{
  int t;
  cin >> t;
  while (t--) solve();
}