CF1185F.Two Pizzas

A company of $n$ friends wants to order exactly two pizzas. It is known that in total there are $9$ pizza ingredients in nature, which are denoted by integers from $1$ to $9$.

Each of the $n$ friends has one or more favorite ingredients: the $i$-th of friends has the number of favorite ingredients equal to $f_i$ ($1 \le f_i \le 9$) and your favorite ingredients form the sequence $b_{i1}, b_{i2}, \dots, b_{if_i}$ ($1 \le b_{it} \le 9$).

The website of CodePizza restaurant has exactly $m$ ($m \ge 2$) pizzas. Each pizza is characterized by a set of $r_j$ ingredients $a_{j1}, a_{j2}, \dots, a_{jr_j}$ ($1 \le r_j \le 9$, $1 \le a_{jt} \le 9$) , which are included in it, and its price is $c_j$.

Help your friends choose exactly two pizzas in such a way as to please the maximum number of people in the company. It is known that a person is pleased with the choice if each of his/her favorite ingredients is in at least one ordered pizza. If there are several ways to choose two pizzas so as to please the maximum number of friends, then choose the one that minimizes the total price of two pizzas.

一家由 $n$ 位朋友组成的团体想要恰好订购两张披萨。已知自然界中总共有 $9$ 种披萨配料，分别用整数 $1$ 到 $9$ 表示。

这 $n$ 位朋友中的每一位都拥有一种或多种喜爱的配料：第 $i$ 位朋友喜爱的配料数量为 $f_i$（$1 \le f_i \le 9$），其喜爱的配料序列为 $b_{i1}, b_{i2}, \dots, b_{if_i}$（其中 $1 \le b_{it} \le 9$）。

CodePizza 餐厅网站上恰好有 $m$（$m \ge 2$）种披萨可供选择。每种披萨 $j$ 由其所含的 $r_j$ 种配料 $a_{j1}, a_{j2}, \dots, a_{jr_j}$（$1 \le r_j \le 9$，且 $1 \le a_{jt} \le 9$）所刻画，其价格为 $c_j$。

请帮助这群朋友恰好挑选两张披萨，使得尽可能多的朋友感到满意。已知：当某位朋友的所有喜爱配料均至少出现在所选的两张披萨之一中时，该朋友即被取悦。若存在多种方式可选出两张披萨以取悦最多数量的朋友，则在这些方案中选择总价格最小的一种。

The first line of the input contains two integers $n$ and $m$ ($1 \le n \le 10^5, 2 \le m \le 10^5$) — the number of friends in the company and the number of pizzas, respectively.

Next, the $n$ lines contain descriptions of favorite ingredients of the friends: the $i$-th of them contains the number of favorite ingredients $f_i$ ($1 \le f_i \le 9$) and a sequence of distinct integers $b_{i1}, b_{i2}, \dots, b_{if_i}$ ($1 \le b_{it} \le 9$).

Next, the $m$ lines contain pizza descriptions: the $j$-th of them contains the integer price of the pizza $c_j$ ($1 \le c_j \le 10^9$), the number of ingredients $r_j$ ($1 \le r_j \le 9$) and the ingredients themselves as a sequence of distinct integers $a_{j1}, a_{j2}, \dots, a_{jr_j}$ ($1 \le a_{jt} \le 9$).

输入的第一行包含两个整数 $n$ 和 $m$（$1 \le n \le 10^5$，$2 \le m \le 10^5$），分别表示公司中朋友的数量和披萨的数量。

接下来的 $n$ 行描述了每位朋友喜爱的食材：其中第 $i$ 行包含一个整数 $f_i$（$1 \le f_i \le 9$）以及一个由 $f_i$ 个互不相同的整数构成的序列 $b_{i1}, b_{i2}, \dots, b_{if_i}$（$1 \le b_{it} \le 9$），分别表示第 $i$ 位朋友喜爱的食材种类数及其具体喜爱的食材编号。

接下来的 $m$ 行描述了每种披萨的信息：其中第 $j$ 行包含一个整数 $c_j$（$1 \le c_j \le 10^9$）表示该披萨的价格，一个整数 $r_j$（$1 \le r_j \le 9$）表示该披萨所含的食材种类数，以及一个由 $r_j$ 个互不相同的整数构成的序列 $a_{j1}, a_{j2}, \dots, a_{jr_j}$（$1 \le a_{jt} \le 9$），表示该披萨所含的具体食材编号。

Output two integers $j_1$ and $j_2$ ($1 \le j_1,j_2 \le m$, $j_1 \ne j_2$) denoting the indices of two pizzas in the required set. If there are several solutions, output any of them. Pizza indices can be printed in any order.

输出两个整数 $j_1$ 和 $j_2$（$1 \le j_1,j_2 \le m$，且 $j_1 \ne j_2$），表示所要求集合中两个披萨的索引。若存在多种解，输出任意一种即可。披萨索引的输出顺序可以任意。