#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void gcdex(long long a, long long b, long long& x, long long& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return;
  }
  long long x1, y1;
  gcdex(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
}
long long phi(long long n) {
  long long result = n;
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      while (n % i == 0) {
        n /= i;
      }
      result -= result / i;
    }
  }
  if (n > 1) {
    result -= result / n;
  }
  return result;
}
void solve() {
  long long n, m, x;
  cin >> n >> m;
  map<long long, pair<long long, long long> > mp;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      cin >> x;
      mp[x].second = j;
    }
  }
  for (long long i = 0; i < m; i++) {
    for (long long j = 0; j < n; j++) {
      cin >> x;
      mp[x].first = j;
    }
  }
  vector<vector<long long> > ans(n, vector<long long>(m));
  for (auto it = mp.begin(); it != mp.end(); it++) {
    ans[it->second.first][it->second.second] = it->first;
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      cout << ans[i][j] << ' ';
    }
    cout << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
