// horizon
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <functional>

using namespace std;

int N;
int Man[120];
int ManPref[120][120];
int WomanPref[120][120];
int WomanNow[120];

bool prefer(int m, int w, int x){
  for(int i=0; i<N; i++){
    if(ManPref[m][i] == w){
      return true;
    }else if(ManPref[m][i] == x){
      return false;
    }
  }
  int i = 0;
  cout << (1 / i);
}

void solve(int w){
  while(true){
    WomanNow[w]++;
    int m = WomanPref[w][WomanNow[w]];
    int x = Man[m];
    if(x == 0){
      Man[m] = w;
      return;
    }
    if(prefer(m, w, x)){
      Man[m] = w;
      solve(x);
      return;
    }
  }  
}

int main()
{
  ifstream cin("match.txt");
  int QQ;
  cin >> QQ;
  for(int iii=0; iii<QQ; iii++){
    cin >> N;
    for(int i=1; i<=N; i++){
      for(int j=0; j<N; j++){
	cin >> ManPref[i][j];
      }
      Man[i] = 0;
    }
    for(int i=1; i<=N; i++){
      for(int j=0; j<N; j++){
	cin >> WomanPref[i][j];
      }
      WomanNow[i] = -1;
    }
    for(int i=1; i<=N; i++){
      solve(i);
    }
    for(int i=1; i<N; i++){
      cout << Man[i] << " ";
    }
    cout << Man[N] << endl;
  }
}