Problem:
Disjoint Set

Write a program which manipulates a disjoint set S = {S1, S2, . . . , Sk}.

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 Sx and Sy, into a new set.

same(x, y): determine whether x and y are in the same set.

Input

n q
com1 x1 y1
com2 x2 y2
...
comq xq yq

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.

Output

For each same operation, print 1 if x and y are in the same set, otherwise 0, in a line.

Constraints

1 ≤ n ≤ 10000

1 ≤ q ≤ 100000

x ≠ y

Sample Input

5 12
0 1 4
0 2 3
1 1 2
1 3 4
1 1 4
1 3 2
0 1 3
1 2 4
1 3 0
0 0 4
1 0 2
1 3 0

Sample Output

0
0
1
1
1
0
1
1

Solution in C (judge verdict: Accepted)

#include<stdio.h>
#define MAX 100001
#define NMAX 10001


void Union(int A[],int x,int y,int i,int n){
int tempX,tempY,j;

if(A[x]!=-1&&A[y]!=-1){
 tempX=A[x];
 tempY=A[y];
 for(j=0;j<n;j++){if(A[j]==tempX||A[j]==tempY)A[j]=i;}
}
else if(A[x]==-1&&A[y]==-1){
 A[x]=i;
 A[y]=i;
}
else{
 if(A[x]==-1){A[x]=A[y];}
 else{A[y]=A[x];}
}

return;
}



int same(int A[],int x,int y){
if(A[x]==A[y]&&A[x]!=-1&&A[y]!=-1){return 1;}
else{return 0;}
}


int main(){
int n,q;
int i,com,x,y;
int temp;
int C[MAX];
int A[NMAX];


scanf("%d %d",&n,&q);/*n,qの読み込み*/

for(i=0;i<n;i++){A[i]=-1;}/*Aの初期化*/
for(i=0;i<q;i++){C[i]=-1;}


for(i=0;i<q;i++){
 scanf("%d %d %d",&com,&x,&y);
 switch(com){
  case 0:Union(A,x,y,i,n);
         break;
  case 1:C[i]=same(A,x,y);
         break;
 }
}



for(i=0;i<q;i++){/*表示*/
 if(C[i]==0||C[i]==1){printf("%d\n",C[i]);}
}

return 0;
}