The Strongest Build

Description:

Input:

The first line contains a single integer $$$n$$$ ($$$1 \le n \le 10$$$) — the number of equipment slots.

The $$$i$$$-th of the next $$$n$$$ lines contains the description of the items for the $$$i$$$-th slot. First, one integer $$$c_i$$$ ($$$1 \le c_i \le 2 \cdot 10^5$$$) — the number of items for the $$$i$$$-th slot. Then $$$c_i$$$ integers $$$a_{i,1}, a_{i,2}, \dots, a_{i,c_i}$$$ ($$$1 \le a_{i,1} < a_{i,2} < \dots < a_{i,c_i} \le 10^8$$$).

The sum of $$$c_i$$$ doesn't exceed $$$2 \cdot 10^5$$$.

The next line contains a single integer $$$m$$$ ($$$0 \le m \le 10^5$$$) — the number of banned builds.

Each of the next $$$m$$$ lines contains a description of a banned build — a sequence of $$$n$$$ integers $$$b_1, b_2, \dots, b_n$$$ ($$$1 \le b_i \le c_i$$$).

The builds are pairwise distinct, and there's at least one build that's not banned.

Output:

Print the build with the maximum strength that is not banned from the game. If there are multiple builds with maximum strength, print any of them.

Sample Input:

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

Sample Output:

2 2 3 

Sample Input:

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

Sample Output:

1 2 3

Sample Input:

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

Sample Output:

3 2 2

Sample Input:

4
1 10
1 4
1 7
1 3
0

Sample Output:

1 1 1 1