Problem: 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.

Constraints

* 1 ≤ n ≤ 10000
* 1 ≤ q ≤ 100000
* x ≠ y

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.

Example

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


Output

0
0
1
1
1
0
1
1

Solution (in CPP):

Solution:
#include <iostream>
using namespace std;

int u;
int uni[100010];




int oya(int a){
if (uni[a]<0){
    return a;
}
else{
    uni[a]=oya(uni[a]);
    return oya(uni[a]);
}
}
 
bool ren(int a,int b){
    a=oya(a);
    b=oya(b);
    if(a==b){
    return  false;//renketu
    }
    else{
    return true;   //not renketu
    }
}

void con(int a,int b){
	if(ren(a,b)){
		a=oya(a);
		uni[a]=b;
	}
	
}



int main() {
	int n,q;
cin>>n>>q;
	for(u=0;u<n;u++){
	uni[u]=-1;
	}

for(int u=0;u<q;u++){
	int j,a,b;
cin>>j>>a>>b;
if(j==0){
	con(a,b);
}
else{
	if(ren(a,b)==true){
		cout<<0<<endl;
	}
	else{
		cout<<1<<endl;
	}
	
}
	
	
}


	return 0;
}