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 class Unionfind{
		int[] number;
		
		Unionfind(int n){
			number = new int[n];
			for(int i=0;i<n;i++){
				number[i] = i;
			}
		}
		
		int find(int x){
			if(number[x]==x){
				return x;
			}
			return number[x] = find(number[x]);
		}
		
		void unite(int x,int y){
			if(number[x]==number[y]){
				
			}
			else{
				number[find(x)] = number[find(y)];
			}
		}
		
		void same(int x,int y){
			if(number[find(x)]==number[find(y)]){
				System.out.println("1");
			}
			else{
				System.out.println("0");
			}
		}
	}
	
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int q =stdIn.nextInt();
		Unionfind union = new Unionfind(n);
		
		for(int i=0;i<q;i++){
			int com = stdIn.nextInt();
			int x = stdIn.nextInt();
			int y = stdIn.nextInt();
			if(com==0){
				union.unite(x, y);
			}
			else{
				union.same(x, y);
			}
		}
		
	}
}