Articulation points - Timestamps

Entrée

The first line contains the number of vertices $n$ (n \le 100) and edges $m$ of an undirected graph. Vertices are numbered from $1$ to $n$. Each of the next $m$ lines contains two vertices $a$ and $b$ - an undirected edge of the graph. The last line contains vertex $v$, from which the search begins.

Sortie

Run $dfs(v)$. Print the timestamps d_v and up_v for each vertex $v$ (v = 1, 2, \ldots, n). The timestamps for each vertex must be printed on a separate line.

Exemples

Note

Use the adjacency matrix for storing the graph.