Problem: All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of n⋅ m different seals, denoted by distinct numbers. All of them were written in an n× m table.

The table is lost now. Naruto managed to remember elements of each row from left to right, and elements of each column from top to bottom, but he doesn't remember the order of rows and columns. Please restore the table consistent with this data so that Naruto will be able to learn the new technique.

Input

The first line of the input contains the only integer t (1≤ t≤ 100 000) denoting the number of test cases. Their descriptions follow.

The first line of each test case description consists of two space-separated integers n and m (1 ≤ n, m ≤ 500) standing for the number of rows and columns in the table, respectively. All hand seals are encoded by the positive integers from 1 to n⋅ m.

The following n lines contain m space separated integers each, denoting elements of an arbitrary row in the table left to right.

The following m lines contain n space separated integers each, denoting elements of an arbitrary column in the table top to bottom.

Sum of nm over all test cases does not exceed 250 000. It is guaranteed that each row occurs in the input exactly once, as well as each column. It is also guaranteed that each number from 1 to nm occurs exactly once in all rows, as well as in all columns. Finally, it is guaranteed that a table consistent with the input exists.

Output

For each test case, output n lines with m space-separated integers each, denoting the restored table. One can show that the answer is always unique.

Example

Input


2
2 3
6 5 4
1 2 3
1 6
2 5
3 4
3 1
2
3
1
3 1 2


Output


1 2 3 
6 5 4 
3 
1 
2 

Note

Consider the first test case. The matrix is 2 × 3. You are given the rows and columns in arbitrary order.

One of the rows is [6, 5, 4]. One of the rows is [1, 2, 3].

One of the columns is [1, 6]. One of the columns is [2, 5]. One of the columns is [3, 4].

You are to reconstruct the matrix. The answer is given in the output.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long LINF = LLONG_MAX - 100;
const int INF = INT_MAX;
const long long MOD = 1e9 + 9;
const long double PI = 3.14159265358979323;
const int N = 5e2, MAXA = 1e5 + 111, H = 1, E = 1e8;
vector<vector<int>> r, c;
vector<pair<vector<int>, int>> s;
int n, m, a[N][N];
bool u[N];
bool cmp(pair<vector<int>, int> a, pair<vector<int>, int> b) {
  return a.first < b.first;
}
void solve() {
  cin >> n >> m;
  r.assign(n, vector<int>(m));
  c.assign(m, vector<int>(n));
  s.resize(0);
  s.resize(m);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> r[i][j];
  for (int j = 0; j < m; j++) {
    u[j] = false;
    s[j].second = j;
    for (int i = 0; i < n; i++) {
      cin >> c[j][i];
      s[j].first.push_back(c[j][i]);
    }
    sort(s[j].first.begin(), s[j].first.end());
  }
  sort(s.begin(), s.end());
  for (int j = 0; j < m; j++) {
    pair<vector<int>, int> need;
    need.second = 0;
    for (int i = 0; i < n; i++) need.first.push_back(r[i][j]);
    sort(need.first.begin(), need.first.end());
    auto p = lower_bound(s.begin(), s.end(), need);
    for (int i = 0; i < n; i++) {
      a[i][j] = c[p->second][i];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << a[i][j] << ' ';
    }
    cout << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}