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 UF:
  def __init__(self,n):
    self.n = n
    self.p = [i for i in range(n)]
    self.r = [1]*n
    self.num = n
  
  def find(self,x):
    if x == self.p[x]:
      return x
    self.p[x] = UF.find(self,self.p[x])
    return self.p[x]
  
  def same(self,x,y):
    return UF.find(self,x) == UF.find(self,y)
  
  def unite(self,x,y):
    x = UF.find(self,x)
    y = UF.find(self,y)
    if x == y:
      return
    if self.r[x] < self.r[y]:
      x,y = y,x
    self.r[x] += self.r[y]
    self.p[y] = x
    self.num -= 1

  def size(self,x):
    return self.r[x]
  
  def count(self):
    return self.num

[n,q] = list(map(int,input().split()))
uf = UF(n)
for i in range(q):
  [com,x,y] = list(map(int,input().split()))
  x -= 1
  y -= 1
  if com == 0:
    uf.unite(x,y)
  else:
    if uf.same(x,y):
      print(1)
    else:
      print(0)