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.*;
import java.io.*;

class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String line = br.readLine();
		String[] str = line.split(" ");
		int n = Integer.parseInt(str[0]);
		UnionFind uf = new UnionFind(n);
		int q = Integer.parseInt(str[1]);

		for (int query=0; query<q; query++) {
			line = br.readLine();
			str = line.split(" ");
			int x = Integer.parseInt(str[1]);
			int y = Integer.parseInt(str[2]);

			if (line.startsWith("0")) {
				uf.unite(x,y);
			}else {
				System.out.println(uf.same(x,y)?"1":"0");
			}
		}

		br.close();
	}
}

class UnionFind {

	int[] node;

	UnionFind(int n){
		node = new int[n];
		for (int i=0; i<n; i++)
			node[i] = i;
	}

	int find(int x){
		if(node[x] == x)
			return x;
		return node[x] = find(node[x]);
	}

	boolean same(int x,int y){
		return find(x) == find(y);
	}

	void unite(int x,int y){
		if (find(x) == find(y))
			return;
		node[find(x)] = find(y);
	}
}