CF1775B.Gardener and the Array

The gardener Kazimir Kazimirovich has an array of $n$ integers $c_1, c_2, \dots, c_n$.

He wants to check if there are two different subsequences $a$ and $b$ of the original array, for which $f(a) = f(b)$, where $f(x)$ is the bitwise OR of all of the numbers in the sequence $x$.

A sequence $q$ is a subsequence of $p$ if $q$ can be obtained from $p$ by deleting several (possibly none or all) elements.

Two subsequences are considered different if the sets of indexes of their elements in the original sequence are different, that is, the values of the elements are not considered when comparing the subsequences.

园丁卡西米尔·卡西米罗维奇有一个包含 $n$ 个整数的数组 $c_1, c_2, \dots, c_n$。

他想检查原数组中是否存在两个不同的子序列 $a$ 和 $b$，使得 $f(a) = f(b)$，其中 $f(x)$ 表示序列 $x$ 中所有数字的按位或结果。

若序列 $q$ 可通过从序列 $p$ 中删除若干（可能为零个、部分或全部）元素得到，则称 $q$ 是 $p$ 的一个子序列。

当且仅当两个子序列在原数组中所对应元素的下标集合不同时，才认为它们是不同的；即，在比较子序列时，不考虑元素的具体数值。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^5$). The description of the test cases follows.

The first line of each test case contains one integer $n$ ($1 \le n \le 10^5$) — the size of the array $c$.

The description of the array $c$ in this problem is given implicitly to speed up input.

The $(i + 1)$-st of the following $n$ lines of the test case begins with an integer $k_i$ ($1 \le k_i \le 10^5$) — the number of set bits in the number $c_i$. Next follow $k_i$ distinct integers $p_{i, 1}, p_{i, 2}, \dots, p_{i, k_i}$ ($1 \le p_i \le 2 \cdot 10^5$) —the numbers of bits that are set to one in number $c_i$. In other words, $c_i = 2^{p_{i, 1}} + 2^{p_{i, 2}} + \ldots + 2^{p_{i, k_i}}$.

It is guaranteed that the total sum of $k_i$ in all tests does not exceed $10^5$.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 10^5$）。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$1 \le n \le 10^5$）—— 数组 $c$ 的大小。

本题中，数组 $c$ 的描述以隐式方式给出，以加快输入速度。

该测试用例接下来的 $n$ 行中，第 $(i + 1)$ 行首先是一个整数 $k_i$（$1 \le k_i \le 10^5$）—— 表示数字 $c_i$ 的二进制表示中为 1 的位数（即“置位比特数”）。随后是 $k_i$ 个互不相同的整数 $p_{i, 1}, p_{i, 2}, \dots, p_{i, k_i}$（$1 \le p_i \le 2 \cdot 10^5$）—— 表示 $c_i$ 中值为 1 的那些比特位的编号（从最低位起编号为 1）。换言之，$c_i = 2^{p_{i, 1}} + 2^{p_{i, 2}} + \ldots + 2^{p_{i, k_i}}$。

保证所有测试用例中 $k_i$ 的总和不超过 $10^5$。

For each set of input, print "Yes" if there exist two different subsequences for which $f(a) = f(b)$, and "No" otherwise.

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

对于每组输入，如果存在两个不同的子序列使得 $f(a) = f(b)$，则输出“Yes”；否则输出“No”。

你可以以任意大小写形式输出答案（大写或小写均可）。例如，字符串“yEs”、“yes”、“Yes”和“YES”均会被识别为肯定回答。

It can be proven that in the first test case there are no two different subsequences $a$ and $b$ for which $f(a) = f(b)$.

In the second test case, one of the possible answers are following subsequences: the subsequence $a$ formed by the element at position $1$, and the subsequence $b$ formed by the elements at positions $1$ and $2$.

In the third test case, one of the possible answers are following subsequences: the subsequence $a$ formed by elements at positions $1$, $2$, $3$ and $4$, and the subsequence $b$ formed by elements at positions $2$, $3$ and $4$.

可以证明，在第一个测试用例中，不存在两个不同的子序列 $a$ 和 $b$，使得 $f(a) = f(b)$。

在第二个测试用例中，一组可能的答案如下：子序列 $a$ 由位置 $1$ 处的元素构成，子序列 $b$ 由位置 $1$ 和 $2$ 处的元素构成。

在第三个测试用例中，一组可能的答案如下：子序列 $a$ 由位置 $1$、$2$、$3$ 和 $4$ 处的元素构成，子序列 $b$ 由位置 $2$、$3$ 和 $4$ 处的元素构成。