A15603 | 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](https://en.wikipedia.org/wiki/Bitwise_operation#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.


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

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.