Write a program which manipulates a disjoint set $S=S_1,S_2,...,S_k$.

First of all, the program should read an integer n, then make a disjoint set where each element consists of 0, 1, ... n−1 respectively.

Next, the program should read an integer q and manipulate the set for q queries. There are two kinds of queries for different operations:

• unite(x,y): unites sets that contain x and y, say $S_x$ and $S_y$, into a new set.
• same(x,y): determine whether x and y are in the same set.

In the first line, n and q are given. 

Then, q queries are given where com represents the type of queries. '0' denotes unite and '1' denotes same operation.