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

lines=readlines(chomp: true).map{|line| line.split(' ').map(&:to_i)}
n_q=lines.shift
datas =[]
lines.each do |query|
    if query[0]==0 then#unite selected sets
        elem1=[]
        elem2=[]
        datas.each do |data|
            if !elem1.empty? && !elem2.empty? then
                break
            elsif data.include?(query[1]) then
                elem1 = data
            elsif data.include?(query[2]) then
                elem2 = data
            end
        end
        if elem1.empty? then
            elem1=[query[1]]
        else
            datas.delete(elem1)
        end
        if elem2.empty? then
            elem2=[query[2]]
        else
            datas.delete(elem2)
        end
        datas << elem1.concat(elem2)
    else #query[0]==1, determine whether two selected elements are in the same sets
        is_exist = 0
        datas.each do |data|
            if data.include?(query[1]) || data.include?(query[2]) then
                if data.include?(query[1]) && data.include?(query[2]) then
                    is_exist = 1
                    break
                end
            end
        end
        puts is_exist
    end
end