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 PYTHON3):

Solution:
class Node:
    def __init__(self):
        self.par = self
        self.rank = 1

class Utree:
    def __init__(self, n):
        self.nodes = [Node() for i in range(n)]

    def root(self, x):
        if x.par is x:
            return x
        else:
            r = self.root(x.par)
            x.par = r
            return r

    def unite(self, x, y):
        xr = self.root(self.nodes[x])
        yr = self.root(self.nodes[y])
        if xr.rank < yr.rank:
            xr.par = yr
            yr.rank += xr.rank
        else:
            yr.par = xr
            xr.rank += yr.rank


    def same(self, x, y):
        return self.root(self.nodes[x]) is self.root(self.nodes[y])



(n, q) = map(int, input().split())
ut = Utree(n)
for i in range(q):
    (c, x, y) = map(int, input().split())
    if c==0:
        ut.unite(x, y)
    else:
        print(1 if ut.same(x, y) else 0)