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.*;

public class Main {

    int[] parents;

    void run() {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int q = sc.nextInt();
        parents = new int[n];
        for (int i = 0; i < n; i++) {
            parents[i] = i;
        }

        for (int i = 0; i < q; i++) {
            int comm = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (comm == 0) {
                unite(x, y);
//                debug(i, parents);
            } else if (comm == 1){
                System.out.println(same(x, y) ? "1" : "0");
            }
        }

        // write your code
//        System.out.println("Hello World");
    }

    void unite(int x, int y) {
        int rep1 = findSet(x);
        int rep2 = findSet(y);
        parents[rep2] = rep1;
    }

    int findSet(int x) {
        int current = x;
        while (parents[current] != current) {
            current = parents[current];
        }
        return current;
    }

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

    void debug(Object... os) {
        System.err.println(Arrays.deepToString(os));
    }

    public static void main(String[] args) {
        new Main().run();
    }
}