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.


-----Input-----

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.


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

Starter code:

Solutions:
from sys import stdin
input = stdin.readline

tests = int(input())
for test in range(tests):
    n, m = list(map(int, input().split()))
    a = [[0] * m for _ in range(n)]
    r = [[int(i) for i in input().split()] for _ in range(n)]
    c = [[int(i) for i in input().split()] for _ in range(m)]
    z = [[-1, -1] for _ in range(n * m + 1)]
    
    for i in range(n):
        for j in range(m):
            z[r[i][j]][0] = j
    for i in range(m):
        for j in range(n):
            z[c[i][j]][1] = j

    for i in range(1, n * m + 1):
        a[z[i][1]][z[i][0]] = i

    for i in a:
        print(' '.join([str(j) for j in i]))


import sys as _sys


def main():
    t = int(input())
    for i_t in range(t):
        
        rows_n, columns_n = _read_ints()
        rows = [tuple(_read_ints()) for i_row in range(rows_n)]
        columns = [tuple(_read_ints()) for i_column in range(columns_n)]
        
        any_first_column_element = rows[0][0]
        
        i_first_column = 0
        while any_first_column_element not in columns[i_first_column]:
            i_first_column += 1
        first_column = columns[i_first_column]
        
        # Can be written in O(N*log(N)) but it is not necessary for N <= 500
        rows = sorted(rows, key=lambda row: first_column.index(row[0]))
        
        for row in rows:
            print(*row)


def _read_line():
    result = _sys.stdin.readline()
    assert result[-1] == "\n"
    return result[:-1]


def _read_ints():
    return list(map(int, _read_line().split()))


def __starting_point():
    main()

__starting_point()

import math
from collections import deque
from sys import stdin, stdout, setrecursionlimit
from string import ascii_letters
letters = ascii_letters[:26]
from collections import defaultdict
#from functools import reduce
input = stdin.readline
#print = stdout.write

for _ in range(int(input())):
    n, m = list(map(int, input().split()))
    horizontal = [list(map(int, input().split())) for i in range(n)]
    vertical = [list(map(int, input().split())) for i in range(m)]
    vals = vertical[0]
    first = vals[0]
    pos = 0
    
    for i in horizontal:
        for g in range(m):
            if i[g] == first:
                pos = g
    
    path = {}
    order = {}
    for ind, i in enumerate(vals):
        path[i] = ind
    for ind, i in enumerate(horizontal):
        order[path[i[pos]]] = ind

    for i in range(len(order)):
        print(*horizontal[order[i]])