CF1413B.A New Technique

All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of $n\cdot m$ different seals, denoted by distinct numbers. All of them were written in an $n\times 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.

忍术世界中的所有技巧均由手印组成。目前，鸣人正在学习一种新技巧，该技巧包含 $n\cdot m$ 个不同的手印，分别用互异的数字表示。这些手印原本被写入一个 $n\times m$ 的表格中。

如今，该表格已遗失。鸣人设法记住了每一行从左到右的元素，以及每一列从上到下的元素，但他不记得各行与各列的顺序。请根据这些信息还原出符合要求的表格，以便鸣人能够学会这项新技巧。

The first line of the input contains the only integer $t$ ($1\leq t\leq 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 \leq n, m \leq 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\cdot 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.

输入的第一行包含一个整数 $t$（$1\leq t\leq 100\,000$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含两个以空格分隔的整数 $n$ 和 $m$（$1 \leq n, m \leq 500$），分别表示表格的行数与列数。所有手印均用从 $1$ 到 $n\cdot m$ 的正整数编码。

接下来的 $n$ 行，每行包含 $m$ 个以空格分隔的整数，表示表格中某一行从左到右的元素。

接下来的 $m$ 行，每行包含 $n$ 个以空格分隔的整数，表示表格中某一列从上到下的元素。

所有测试用例中 $nm$ 的总和不超过 $250\,000$。保证输入中每一行恰好出现一次，每一列也恰好出现一次。还保证 $1$ 到 $nm$ 中的每个数字在所有行中恰好出现一次，在所有列中也恰好出现一次。最后，保证存在一个与输入一致的表格。

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.

对于每个测试用例，输出 $n$ 行，每行包含 $m$ 个以空格分隔的整数，表示恢复后的表格。可以证明答案总是唯一的。

Consider the first test case. The matrix is $2 \times 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.

考虑第一个测试用例。该矩阵为 $2 \times 3$。你以任意顺序给出各行与各列。

其中一行是 $[6, 5, 4]$，另一行是 $[1, 2, 3]$。

其中一列是 $[1, 6]$，另一列是 $[2, 5]$，还有一列是 $[3, 4]$。

你需要重构该矩阵。答案已在输出中给出。