CF1413B.A New Technique

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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

输入格式

The first line of the input contains the only integer tt ( 1t1000001\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 nn and mm ( 1n,m5001 \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 11 to nmn\cdot m .

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 250000250\,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 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.

输入输出样例

  • 输入#1

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

    输出#1

    1 2 3 
    6 5 4 
    3 
    1 
    2

说明/提示

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

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

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

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

首页