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;

class Main {

	/*
	 * 着席位置：中央前から３列目
	 * 問題：https://onlinejudge.u-aizu.ac.jp/problems/DSL_1_A
	 */

	private static int n[];

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		n = new int[Integer.parseInt(scanner.next())];
		for(int i=0; i<n.length; i++) {
			n[i] = i;//最初は全てroot
		}
		int q = Integer.parseInt(scanner.next());

		for(int i=0; i<q; i++) {
			String order = scanner.next();
			if(order.equals("0")) {
				unite(Integer.parseInt(scanner.next()), Integer.parseInt(scanner.next()));
			}else if(order.equals("1")){
				same(Integer.parseInt(scanner.next()), Integer.parseInt(scanner.next()));
			}
		}

		scanner.close();
	}

	//木を合体させる
	private static void unite(int x, int y) {
		int X = root(x), Y = root(y);
		n[Y] = X;
	}

	//同じ木か調べる
	private static void same(int x, int y) {
		if (root(x)==root(y)) {
			System.out.println("1");
		}else {
			System.out.println("0");
		}
	}

	//rootを返す
	private static int root(int i) {
		if(n[i]==i) return i;
		else {
			return root(n[i]);
		}
	}

}