Undirected graph is given. Run depth first search from the given vertex . Print the timestamps and for each vertex in the increasing order of vertices.
The first line contains number of vertices and edges of undirected graph. Each of the next lines contains two vertices and — an undirected edge of the graph. The last line contains vertex .
Run . Print the timestamps and for each vertex . The timestamps for each vertex must be printed in a separate line.