Euclid's nightmare
Contest: Good Bye 2020
Difficulty rating: 2100
Tags: bitmasks, dfs and similar, dsu, graphs, greedy, math, sortings

You may know that Euclid was a mathematician. Well, as it turns out, Morpheus knew it too. So when he wanted to play a mean trick on Euclid, he sent him an appropriate nightmare.

In his bad dream Euclid has a set $$$S$$$ of $$$n$$$ $$$m$$$-dimensional vectors over the $$$\mathbb{Z}_2$$$ field and can perform vector addition on them. In other words he has vectors with $$$m$$$ coordinates, each one equal either $$$0$$$ or $$$1$$$. Vector addition is defined as follows: let $$$u+v = w$$$, then $$$w_i = (u_i + v_i) \bmod 2$$$.

Euclid can sum any subset of $$$S$$$ and archive another $$$m$$$-dimensional vector over $$$\mathbb{Z}_2$$$. In particular, he can sum together an empty subset; in such a case, the resulting vector has all coordinates equal $$$0$$$.

Let $$$T$$$ be the set of all the vectors that can be written as a sum of some vectors from $$$S$$$. Now Euclid wonders the size of $$$T$$$ and whether he can use only a subset $$$S'$$$ of $$$S$$$ to obtain all the vectors from $$$T$$$. As it is usually the case in such scenarios, he will not wake up until he figures this out. So far, things are looking rather grim for the philosopher. But there is hope, as he noticed that all vectors in $$$S$$$ have at most $$$2$$$ coordinates equal $$$1$$$.

Help Euclid and calculate $$$|T|$$$, the number of $$$m$$$-dimensional vectors over $$$\mathbb{Z}_2$$$ that can be written as a sum of some vectors from $$$S$$$. As it can be quite large, calculate it modulo $$$10^9+7$$$. You should also find $$$S'$$$, the smallest such subset of $$$S$$$, that all vectors in $$$T$$$ can be written as a sum of vectors from $$$S'$$$. In case there are multiple such sets with a minimal number of elements, output the lexicographically smallest one with respect to the order in which their elements are given in the input.

Consider sets $$$A$$$ and $$$B$$$ such that $$$|A| = |B|$$$. Let $$$a_1, a_2, \dots a_{|A|}$$$ and $$$b_1, b_2, \dots b_{|B|}$$$ be increasing arrays of indices elements of $$$A$$$ and $$$B$$$ correspondingly. $$$A$$$ is lexicographically smaller than $$$B$$$ iff there exists such $$$i$$$ that $$$a_j = b_j$$$ for all $$$j < i$$$ and $$$a_i < b_i$$$.

Input format:
In the first line of input, there are two integers $$$n$$$, $$$m$$$ ($$$1 \leq n, m \leq 5 \cdot 10^5$$$) denoting the number of vectors in $$$S$$$ and the number of dimensions.

Next $$$n$$$ lines contain the description of the vectors in $$$S$$$. In each of them there is an integer $$$k$$$ ($$$1 \leq k \leq 2$$$) and then follow $$$k$$$ distinct integers $$$x_1, \dots x_k$$$ ($$$1 \leq x_i \leq m$$$). This encodes an $$$m$$$-dimensional vector having $$$1$$$s on coordinates $$$x_1, \dots x_k$$$ and $$$0$$$s on the rest of them.

Among the $$$n$$$ vectors, no two are the same.

Output format:
In the first line, output two integers: remainder modulo $$$10^9+7$$$ of $$$|T|$$$ and $$$|S'|$$$. In the second line, output $$$|S'|$$$ numbers, indices of the elements of $$$S'$$$ in ascending order. The elements of $$$S$$$ are numbered from $$$1$$$ in the order they are given in the input.

Constraints:
Time limit: 2.0 s
Memory limit: 256.0 MB

Note:
In the first example we are given three vectors:

- $$$10$$$
- $$$01$$$
- $$$11$$$

It turns out that we can represent all vectors from our $$$2$$$-dimensional space using these vectors:

- $$$00$$$ is a sum of the empty subset of above vectors;
- $$$01 = 11 + 10$$$, is a sum of the first and third vector;
- $$$10 = 10$$$, is just the first vector;
- $$$11 = 10 + 01$$$, is a sum of the first and the second vector.

Hence, $$$T = \{00, 01, 10, 11\}$$$. We can choose any two of the three vectors from $$$S$$$ and still be able to obtain all the vectors in $$$T$$$. In such a case, we choose the two vectors which appear first in the input. Since we cannot obtain all vectors in $$$T$$$ using only a single vector from $$$S$$$, $$$|S'| = 2$$$ and $$$S' = \{10, 01\}$$$ (indices $$$1$$$ and $$$2$$$), as set $$$\{1, 2 \}$$$ is lexicographically the smallest. We can represent all vectors from $$$T$$$, using only vectors from $$$S'$$$, as shown below:

- $$$00$$$ is a sum of the empty subset;
- $$$01 = 01$$$ is just the second vector;
- $$$10 = 10$$$ is just the first vector;
- $$$11 = 10 + 01$$$ is a sum of the first and the second vector.

Example input:
3 2
1 1
1 2
2 2 1

Example output:
4 2
1 2

Example input:
2 3
2 1 3
2 1 2

Example output:
4 2
1 2

Editorial:
We start by simplifying the task. Increase the length of all vectors by $$$1$$$, i.e., add additional dimension. For the vectors from $$$S$$$, the $$$m+1$$$-th character will be $$$1$$$ in those with exactly one character $$$1$$$. This way, all the vectors in $$$S$$$ will have $$$1$$$s on precisely two positions.
When we have some items and some subsets of these items of size exactly $$$2$$$, it is intuitive to create a graph on these items. Thus we create a graph where vertices represent dimensions of our space, and edges are vectors given in the input.
Consider a sum of a subset of vectors in the input. Notice that each such vector contributes $$$1$$$ to the sum at exactly $$$2$$$ positions. Thus the resulting vector has an even number of $$$1$$$.
Moreover, consider any connected component in the constructed graph. Note that our vector needs to have an even number of $$$1$$$ in each connected component for the same reason. It turns out that we can represent any vector fulfilling this condition.
From these observations, we conclude that all we care about are connected components of the graph. Thus the answer is the MST of this graph, where the value of an edge is its index. The number of achievable vectors is $$$2^{|S'|}$$$. Complexity is $$$\mathcal{O}((n + m) \log (n + m))$$$ or faster depending on the algorithm to find the MST.