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 JAVA):

Solution:
import java.util.*;
public class Main{
	public static void unite(Node x, Node y){
		leader(y).parent = leader(x);
	}
	public static Node leader(Node x){
		if(x.parent == x)
			return x;
		else
			return x.parent = leader(x.parent);
	}
	public static int same(Node x, Node y){
		if(leader(x) == leader(y))
			return 1;
		else
			return 0;
	}
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int q = sc.nextInt();
		Node[] nodes = new Node[n];
		for(int i = 0 ; i < n ; i++)
			nodes[i] = new Node(i,true);
		for(int i = 0 ; i < q ; i++){
			int com = sc.nextInt();
			int x = sc.nextInt();
			int y = sc.nextInt();
			switch(com){
				case 0: unite(nodes[x],nodes[y]); break;
				case 1: System.out.println(same(nodes[x],nodes[y])); break;
			}
		}
	}
}
class Node{
	int isRoot;
	int data;
	Node parent = this;
	Node(int data, boolean isroot){
		this.data = data;
		if(isroot)
			isRoot = 1;
		else
			isRoot = 0;
	}
}