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.Scanner;


public class Main{

	static int[] parent;
	static int[] height;
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		String[] tmp = s.nextLine().split(" ");
		int edgeCnt = Integer.parseInt(tmp[0]);
		parent = new int[edgeCnt];
		height = new int[edgeCnt];
		for(int k=0 ; k<edgeCnt ; k++) {
			parent[k] = -1;
		}
		int direCnt = Integer.parseInt(tmp[1]);
		for(int i=0 ; i<direCnt ; i++) {
			String[] tmp1 = s.nextLine().split(" ");
			if("0".equals(tmp1[0])) {
				unite(Integer.parseInt(tmp1[1]), Integer.parseInt(tmp1[2]));
			}else {
				System.out.println(same(Integer.parseInt(tmp1[1]), Integer.parseInt(tmp1[2])));
			}
		}

	}

	public static void unite(int formmer, int latter) {
		while(parent[formmer]!=-1) {
			formmer = parent[formmer];
		}
		while(parent[latter]!=-1) {
			latter = parent[latter];
		}
		if(formmer==latter)
			return;
		if(height[formmer]==height[latter] && formmer>latter) {
			parent[formmer] = latter;
			height[latter]++;
		}else if(height[formmer]==height[latter] && formmer<latter) {
			parent[latter] = formmer;
			height[formmer]++;
		}else if(height[formmer]>height[latter]) {
			parent[latter] = formmer;
		}else if(height[formmer]<height[latter]) {
			parent[formmer] = latter;
		}
	}

	public static int same(int formmer, int latter) {
		while(parent[formmer]!=-1) {
			formmer = parent[formmer];
		}
		while(parent[latter]!=-1) {
			latter = parent[latter];
		}
		if(formmer==latter)
			return 1;
		else
			return 0;
	}

}