Problem:
Disjoint Set

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.

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.

Constraints

1 ≤ n ≤ 10000

1 ≤ q ≤ 100000

x ≠ y

Sample 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

Sample Output

0
0
1
1
1
0
1
1

Solution in Ruby (judge verdict: Time Limit Exceeded)

require 'set'

n,q = gets.split.map(&:to_i)
data = []

0.upto(n - 1) do |i|
  data << Set.new([i])
end

q.times do
  i, j, k = gets.split.map(&:to_i)
  j, k = k, j if j > k

  if i == 0  # unite
    x, y = 0, 0
    is_find_x = false
    is_find_y = false

    data.each_with_index do |e, i|
      unless is_find_x
        if e.include?(j)
          x = i
          is_find_x = true
        end
      end

      unless is_find_y
        if e.include?(k)
          y = i
          is_find_y = true
        end
      end
      break if is_find_x & is_find_y
    end
    next if x == y

    data[x] = data[x] + data[y]
    data.delete_at(y)

  else  #same
    result = 0
    data.each do |e|
      s = Set.new([j, k])
      flag = (s & e).size
      if flag == 1
        break
      elsif flag == 2
        result = 1
        break
      end
    end
    p result
  end
end