B'Unfortunately, a mistake was found in the proof of the author 's solution to this problem. Currently, we don 't know the absolutely correct solution. However, you can solve this task, but if your solution passes all the tests, it is not guaranteed to be correct. If your solution has passed all the tests and you are sure that it is correct, you can write to one of the contest authors about it. Surely you all read the book "Alice in Wonderland". In this task, Nastya got to the country of Three strange Bees. The bees are strange because their honeycombs are pentagonal. Nastya got there illegally, so she wants bees not to catch her. Help the bees punish the intruder! This is an interactive problem. A beehive is a connected undirected graph where bees and Nastya can move along the edges. A graph satisfies two properties: You win if at least one of the bees and Nastya are in the same vertex at any time of the game. If this situation does not occur after n moves, then you lose. Several bees can be in the same vertex. The first line contains two integers n (4 <= q n <= q 5000) and m (n <= q m <= q 3n) -- the number of vertices and edges in the graph. Each of the next m lines contains two integers v and u (1 <= q v, u <= q n) , which mean that there is an edge between the vertices v and u . It is guaranteed that the graph is connected, does not contain loops that the degree of any vertex does not exceed 3 and a cycle of length no more than 5 passes through each edge. Note that the graph may contain multiple edges. At each turn, you must output exactly three vertices a, b, c (1 <= q a, b, c <= q n) . For the first time, 3 vertices displayed will indicate which vertices you originally placed bees on. In response, you will receive the vertex where the jury placed Nastya. Each next 3 vertices will indicate where the 3 bees move at your turn. Each of the bees can'...