#include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #include<map>

 #include<string>

 using namespace std;

 #define maxn 1005

 string str[maxn];

 string dic[maxn][];

 map<string,string> map1;

 pair<map<string,string>::iterator,bool> iter;

 int main()

 {

     int T,n;

     cin>>T;

     while(T--)

     {

         cin>>n;

         for(int i = ;i <= n;++i)

         cin>>str[i];

         for(int i = ;i <= n;++i)

         cin>>dic[i][];

         for(int i = ;i <= n;++i)

         cin>>dic[i][];

         map1.clear();

         for(int i = ;i <= n;++i)

         map1.insert(pair<string,string> (dic[i][],dic[i][]));

         for(int i = ;i <= n;++i)

         {

             if(i == n) cout<<map1[str[i]]<<endl;

             else cout<<map1[str[i]]<<" ";

         }

     }

     return ;

 }