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>
#include<stdbool.h>


/*
#define true 1
#define false 0
typedef int bool;
*/

#define MAX 1000000
int par[MAX];
int rank[MAX];
int n, q;

void init(void){
	int i;
	for(i=0; i<n; i++){
		par[i] = i;
		rank[i] = 0;
	}
}

int root(int x){
	//printf("root:x=%d\n", x);//check
	return par[x] == x ? x : (par[x] = root(par[x]));
}

bool same(int x, int y){
	return root(x) == root(y);
}

void unite(int x, int y){
	x = root(x);
	y = root(y);
	//printf("root:x=%d, y=%d\n", x, y);//check
	if(x == y) return;
	
	if(rank[x] < rank[y]){
		par[x] = y;
	}else{
		par[y] = x;
		if(rank[x] == rank[y]) rank[x]++;
	}
}

#define UNITE 0
#define SAME  1
void readQuery(void){
	int i;
	for(i=0; i<q; i++){
		int com, x, y;
		scanf("%d%d%d", &com, &x, &y);
		//printf("%d %d %d\n", com, x, y);//check
		if(com == UNITE){
			unite(x, y);
		}else if(com == SAME){
			printf("%c\n", same(x, y) ? '1' : '0');
		}
	}
}


int main(void){
	scanf("%d%d", &n, &q);
	
	init();
	
	readQuery();
	
	return 0;
}