B'You are given a functional graph. It is a directed graph, in which from each vertex goes exactly one arc. The vertices are numerated from 0 to n xe2 x80 x89- xe2 x80 x891. Graph is given as the array f0, xe2 x80 x89f1, xe2 x80 x89..., xe2 x80 x89fn xe2 x80 x89- xe2 x80 x891, where fi -- the number of vertex to which goes the only arc from the vertex i. Besides you are given array with weights of the arcs w0, xe2 x80 x89w1, xe2 x80 x89..., xe2 x80 x89wn xe2 x80 x89- xe2 x80 x891, where wi -- the arc weight from i to fi. Also you are given the integer k (the length of the path) and you need to find for each vertex two numbers si and mi, where: The length of the path is the number of arcs on this path. The first line contains two integers n, xe2 x80 x89k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891010). The second line contains the sequence f0, xe2 x80 x89f1, xe2 x80 x89..., xe2 x80 x89fn xe2 x80 x89- xe2 x80 x891 (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89fi xe2 x80 x89< xe2 x80 x89n) and the third -- the sequence w0, xe2 x80 x89w1, xe2 x80 x89..., xe2 x80 x89wn xe2 x80 x89- xe2 x80 x891 (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89wi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89108). Print n lines, the pair of integers si, mi in each line.'...