Statement

The final round of IIOT is approaching and after solving so many tree problems during the previous edition of the contest, you start to wonder what the next tree problem is going to be. Your instincts were spot-on, finally here is a tree problem for you to solve! You are given a tree graph with N nodes, rooted at vertex 0. We define the K-th ancestor of a vertex as the node we reach if we move K steps up the tree, in the direction of the root. If we reach the root before doing K steps, then we say that the K-th ancestor does not exist. For a fixed integer K, your task is to find the K-th ancestor of each node in the tree, or report that it doesn't exist. Pay attention to the unusual memory limit!