# NOTE: 1-origin (not 0-origin)
$adj_lists = []

def find_min_dist(start_node, target_node)
  if start_node == target_node
    0
  else
    nodes = $adj_lists[start_node]
    if nodes == []
      return Float::INFINITY
    else
      mins = nodes.map{|n|
        find_min_dist(n, target_node)
      }
      # p ['nodes', nodes, 'min', mins]
      return mins.min + 1
    end
  end
end

_ = gets


while line = gets
  i, _, *nodes= line.split(' ').map(&:to_i)
  $adj_lists[i] = nodes
end

# # NOTE: 1-origin
# distances = [nil] * $adj_lists.size
#
# distances[1] = 0
#
# # (1..$adj_lists.size).each{|i|
# #
# # }
#
# # p $adj_lists

# Print
(1...$adj_lists.size).each{|target_node|
  min_dist = find_min_dist(1, target_node)
  puts("#{target_node} #{min_dist}")

}

# p find_node(1, 2)
# p find_node(1, 3)
# p find_node(1, 4)
#
# # p distances

