CF1574D.The Strongest Build

Ivan is playing yet another roguelike computer game. He controls a single hero in the game. The hero has $n$ equipment slots. There is a list of $c_i$ items for the $i$-th slot, the $j$-th of them increases the hero strength by $a_{i,j}$. The items for each slot are pairwise distinct and are listed in the increasing order of their strength increase. So, $a_{i,1} \lt a_{i,2} \lt \dots \lt a_{i,c_i}$.

For each slot Ivan chooses exactly one item. Let the chosen item for the $i$-th slot be the $b_i$-th item in the corresponding list. The sequence of choices $[b_1, b_2, \dots, b_n]$ is called a build.

The strength of a build is the sum of the strength increases of the items in it. Some builds are banned from the game. There is a list of $m$ pairwise distinct banned builds. It's guaranteed that there's at least one build that's not banned.

What is 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.

伊万正在玩另一款类Roguelike电脑游戏。他在游戏中控制一名英雄。该英雄有 $n$ 个装备栏位。第 $i$ 个栏位有 $c_i$ 件可选物品，其中第 $j$ 件物品使英雄力量提升 $a_{i,j}$。每个栏位的物品互不相同，且按其力量提升值升序排列，即满足 $a_{i,1} \lt a_{i,2} \lt \dots \lt a_{i,c_i}$。

对于每个栏位，伊万必须恰好选择一件物品。设第 $i$ 个栏位所选物品为其对应列表中的第 $b_i$ 件，则选择序列 $[b_1, b_2, \dots, b_n]$ 称为一个“构筑”（build）。

一个构筑的力量值等于其所选所有物品的力量提升值之和。游戏中存在若干被禁止的构筑。给定一个包含 $m$ 个两两不同的被禁构筑的列表。保证至少存在一个未被禁止的构筑。

请找出所有未被禁止的构筑中力量值最大的那个。若存在多个力量值最大的未被禁止构筑，输出任意一个即可。

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} \lt a_{i,2} \lt \dots \lt 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.

第一行包含一个整数 $n$（$1 \le n \le 10$）—— 表示装备槽的数量。

接下来的 $n$ 行中，第 $i$ 行描述第 $i$ 个装备槽可选的物品。首先是一个整数 $c_i$（$1 \le c_i \le 2 \cdot 10^5$）—— 表示第 $i$ 个装备槽的物品数量；随后是 $c_i$ 个整数 $a_{i,1}, a_{i,2}, \dots, a_{i,c_i}$（$1 \le a_{i,1} \lt a_{i,2} \lt \dots \lt a_{i,c_i} \le 10^8$）。

所有 $c_i$ 的总和不超过 $2 \cdot 10^5$。

下一行包含一个整数 $m$（$0 \le m \le 10^5$）—— 表示被禁止的装备组合数量。

接下来的 $m$ 行每行描述一个被禁止的装备组合：即一个由 $n$ 个整数组成的序列 $b_1, b_2, \dots, b_n$（$1 \le b_i \le c_i$）。

所有被禁止的装备组合两两不同，且至少存在一个未被禁止的装备组合。

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.

输出游戏中未被禁止的、强度最大的构筑。如果存在多个强度最大的构筑，则输出其中任意一个。