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.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main{
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		String line = sc.nextLine();
		int n = Integer.valueOf(line.split(" ")[0]);
		int q = Integer.valueOf(line.split(" ")[1]);
		
		Map<Integer, Node> nodes = new TreeMap<>();
		for(int i = 0; i < n; i++){
			nodes.put(i, new Node(i));
		}
		for(int i = 0; i < q; i++){
			String query = sc.nextLine();
			int com = Integer.valueOf(query.split(" ")[0]);
			int x = Integer.valueOf(query.split(" ")[1]);
			int y = Integer.valueOf(query.split(" ")[2]);
			
			switch(com){
				case 0:
					unite(nodes, x, y);
					break;
				case 1:
					System.out.println(same(nodes, x, y)? "1": "0");
					break;
			}
		}
	}
	
	static void unite(Map<Integer, Node> map, int x, int y){
		map.get(y).getRoot().setParent(map.get(x));
	}
	
	static boolean same(Map<Integer, Node> map, int x, int y){
		return map.get(x).getRoot().getNo() == map.get(y).getRoot().getNo();
	}
}

class Node{
	int no;
	Node parent;
	
	int getNo(){
		return no;
	}
	
	void setParent(Node n){
		if(n.getRoot() != this) this.parent = n;
		if(parent != this)this.parent.setParent(n.getRoot());
	}
	
	Node getRoot(){
		if(parent != this) return parent.getRoot();
		else return this;	
	}
	
	Node(int no){
		this.no = no;
		parent = this;
	}
}