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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main{
    static List<Integer> nList = new ArrayList<>();
    static List<Integer> rankList = new ArrayList<>();

    static int[] p;
    static int[] rank;

    public static void main(String args[]){


        Scanner scanner = new Scanner(System.in);

        int n = Integer.parseInt(scanner.next());
        int q = Integer.parseInt(scanner.next());

        p = new int[n];
        rank = new int[n];

        int query;
        int x;
        int y;



        for(int i = 0; i < n; i++){
           p[i] = i;
           rank[i] = 0;
        }

        for(int i = 0; i < q; i++){
           query = Integer.parseInt(scanner.next());
           x = Integer.parseInt(scanner.next());
           y = Integer.parseInt(scanner.next());

           if(query == 0){
               union(x, y);
           }else {
               same(x, y);
           }

        }



    }


    static public void link(int x, int y){
        if(rank[x] > rank[y]){
            p[y] = x;
        }else {
            p[x] = y;
        }
        if(rank[x] == rank[y]){
            rank[y] = rank[y] + 1;
        }
    }

    static public int findSet(int x){
        if(x != p[x]){
            p[x] = findSet(p[x]);
        }
        return p[x];
    }

    static public void union(int x, int y){
        link(findSet(x), findSet(y));
            }

    static public void same(int x, int y){
        if(findSet(x) == findSet(y)){
            System.out.println(1);
        }else {
            System.out.println(0);
        }
    }


}