class UnionFind
  def initialize
    @obj_to_node = {}
  end

  class UnionFind::Node
    def initialize(obj)
      @obj = obj
      @parent = self
      @rank = 0
    end

    def root
      return self if @parent == self
      @parent = @parent.root
    end  

    attr_accessor :parent, :rank
  end

  def unite(x, y)
    u = (@obj_to_node[x] ||= UnionFind::Node.new(x)).root
    v = (@obj_to_node[y] ||= UnionFind::Node.new(y)).root
    return if u == v
    if u.rank > v.rank
      v.parent = u
    elsif v.rank > u.rank
      u.parent = v
    else
      u.parent = v
      v.rank += 1
    end
  end

  def same?(x, y)
    return false unless u = @obj_to_node[x]
    return false unless v = @obj_to_node[y]
    u.root == v.root
  end
end

n, q = gets.split.map(&:to_i)
uf = UnionFind.new
q.times do
  c, x, y = gets.split.map(&:to_i)
  if c == 0
    uf.unite(x, y)
  else
    puts uf.same?(x, y) ? '1' : '0'
  end
end
