#include <bits/stdc++.h>
using namespace std;

#define itloop(it,x) for(auto it=x.begin();it!=x.end();it++)
#define reloop(i,e,b) for(auto i=e;i>=b;i--)
#define loop(i,b,e) for(auto i=b;i<=e;i++)
#define ALL(x) x.begin(),x.end()
#define SZ(x) x.size()
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define sf scanf
#define pf printf
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef pair<int,int> PI;
typedef pair<LL,LL> PL;

int pos(string s) {
   loop(i,0,s.length()-1) {
      if(s[i] != '_')
         return i;
   }
}

string fix(string s,char c) {
   string tmp;
   loop(i,0,25) {
      if(s[i] == c) {
         tmp = s.substr(i,26-i);
         loop(j,0,i-1)
            tmp += s[j];
         break;
      }
   }
   return tmp;
}

void solve(string s[],int n,string key,string word) {
   string ans;
   int p = pos(word),x;
   loop(i,0,n-1)
      s[i] = fix(s[i],key[i]);
   loop(i,0,25) {
      if(word[p] == s[p][i])
         x = i;
   }
   loop(i,0,n-1)
      ans += s[i][x];
   cout << key << " " << ans << "\n";
}

int t,n;
string key,word,s[1001];

int main()
{
   sf("%d",&t);
   loop(i,1,t) {
      sf("%d",&n);
      cin >> key >> word;
      loop(i,0,n-1)
         cin >> s[i];
      solve(s,n,key,word);
   }
}