#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool bs_com(T i, T j) {
  return i < j;
}
template <typename T>
bool sort_asc(T a, T b) {
  return a.first < b.first;
}
template <typename T>
bool sort_des(T a, T b) {
  return a > b;
  ;
}
struct pq_des {
  bool operator()(int const& p1, int const& p2) { return p1 < p2; }
};
struct pq_asc {
  bool operator()(int const& p1, int const& p2) { return p1 > p2; }
};
long long powm(long long a, long long b, long long mod) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
bool is_prime(long long a) {
  for (long long i = 2; i * i <= a; i++) {
    if (a % i == 0) return false;
  }
  return true;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long cntdig(long long n) {
  if (n == 0) return 1LL;
  return (long long)floor(log10(n) + 1.0);
}
void solve() {
  int n, m;
  cin >> n >> m;
  vector<vector<int> > grid(n, vector<int>(m));
  vector<int> mapu(n * m + 1);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> grid[i][j];
      mapu[grid[i][j]] = i;
    }
  }
  vector<int> column(n);
  for (int j = 0; j < n; j++) {
    int x;
    cin >> x;
    int row = mapu[x];
    for (int i = 0; i < m; i++) {
      cout << grid[row][i] << " ";
    }
    cout << "\n";
  }
  for (int i = 0; i < m - 1; i++) {
    for (int j = 0; j < n; j++) {
      int x;
      cin >> x;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cerr.tie(NULL);
  ;
  cout << fixed << setprecision(15);
  int tc_;
  cin >> tc_;
  for (int tc = 1; tc <= tc_; tc++) {
    solve();
  }
  return 0;
}
