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 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int op_num = sc.nextInt();
		String[] op = new String[op_num+1];
		for (int i = 0 ; i < op.length; i++) {
			op[i] = sc.nextLine();
		}
		
		//get the data
		int[][] data = new int[op_num][3];
		for (int i = 1, n1 =0; i<= op_num; i++,n1++) {
			String[] Split = op[i].split(" ");
			for (int j= 0 ;j< 3;j++) {
				data[n1][j] = Integer.parseInt(Split[j]);
			}
		}
		
		
		//operate data
		Set set = new Set (n);
		set.makeset();
		for(int i= 0 ;i < data.length;i++ ) {
			if(data[i][0] == 0)
				set.union(data[i][1], data[i][2]);
			else if(data[i][0] == 1){
				if(set.findset(data[i][1]) == set.findset(data[i][2]))
					System.out.println(1);
				else
					System.out.println(0);
			}
		}
		
	}
}

class Set{
	int[] rank,parent;
	int n;
	
	public Set(int n) {
		rank = new int[n];
		parent = new int[n];
		this.n = n;
		makeset();
	}
	
	void makeset() {
		for(int i= 0 ; i< n; i++)
			parent[i] = i;
	}
	
	int findset(int x) {
		if (parent[x] != x) {
			parent[x] = findset(parent[x]);
		}
		return parent[x];
	}
	
	void union(int x,int y) {
		int x_root = findset(x);
		int y_root = findset(y);
		
		if (x_root == y_root)
			return;
		
		if(rank[x_root]<rank[y_root])
			parent[x_root] = y_root;
		else if (rank[y_root]<rank[x_root])
			parent[y_root] = x_root;
		else {
			parent[y_root] = x_root;
			rank[x_root] = rank[x_root]+1;
		}
	}
}