Unite to Survive

Given $N$ sets $S_1, S_2, \ldots, S_N$, process $Q$ commands as follows.

• 1 a b: Replace $S_a$ with $S_a \cup S_b$, and replace $S_b$ with the empty set. ($1 \le a, b \le N$; $a \ne b$)
• 2 a: Print the size of $S_a$. ($1 \le a \le N$)

The first line contains $N$ and $Q$. ($1 \le N, Q \le 500{,}000$)

Each of the next $N$ lines describes $S_i$. The line starts with its size $n_i$, followed by the elements $s_{ij}$ of $S_i$. ($1 \le \sum n_i \le 500{,}000$; $1 \le s_{ij} \le 10^9$; $s_{ij} \ne s_{ik}$ for all $k \ne j$)

Each of the next $Q$ lines contains one command described above. All input numbers are integers, and at least one command 2 a is given.

For each command 2 a, print the result on its own line.