Ranks in groups

There are $N$ students. For each $i$ with $1 \le i \le N$, student $i$ scores $i$ points on the exam. The students are split into groups, and at the start group $i$ holds only student $i$.

Write a program that supports the following two operations.

1. Group merge: given two group numbers $X$ and $Y$, move every student of group $Y$ into group $X$. After the merge, group $Y$ no longer exists.
2. Query: given a student number $J$, find the rank of student $J$ inside the group that holds student $J$. Within a group, the student with the highest score has rank 1, the student with the second highest score has rank 2, and so on.

Each test case contains $L$ operations.

The first line contains an integer $T$ ($T \le 5$), the number of test cases. Each test case follows in the format below.

The first line of a test case contains two integers $N$ and $L$ ($1 \le N \le 100\,000$, $1 \le L \le 200\,000$).

Each of the next $L$ lines describes one operation. The line starts with an integer $K$, the type of the operation.

• If $K = 1$, two more integers $X$ and $Y$ follow on the same line. Merge the students of group $Y$ into group $X$.
• If $K = 2$, one more integer $J$ follows. Print the rank of student $J$ inside the group that holds student $J$.

Both groups given in a merge operation still exist at that moment, and $X$ and $Y$ are different.

For each query operation, print the rank of that student on its own line. Print the answers of all test cases in the order the queries appear.