All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of n⋅mn⋅m different seals, denoted by distinct numbers. All of them were written in an n×mn×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.
The first line of the input contains the only integer tt (1≤t≤1000001≤t≤100000) denoting the number of test cases. Their desc
The first line of each test case desc
The following nn lines contain mm space separated integers each, denoting elements of an arbitrary row in the table left to right.
The following mm lines contain nn space separated integers each, denoting elements of an arbitrary column in the table top to bottom.
Sum of nmnm over all test cases does not exceed 250000250000. 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 11 to nmnm occurs exactly once in all rows, as well as in all columns. Finally, it is guaranteed that a table consistent with the input exists.
For each test case, output nn lines with mm space-separated integers each, denoting the restored table. One can show that the answer is always unique.
2
2 3
6 5 4
1 2 3
1 6
2 5
3 4
3 1
2
3
1
3 1 2
1 2 3
6 5 4
3
1
2