## BOTTOM - The Bottom of a Graph

no tags

We will use the following (standard) definitions from graph theory. Let $V$ be a nonempty and finite set, its elements being called vertices (or nodes). Let $E$ be a subset of the Cartesian product $V \times V$, its elements being called edges. Then $G = (V, E)$ is called a directed graph.

Let $n$ be a positive integer, and let $p = (e_1, \ldots, e_n)$ be a sequence of length $n$ of edges $e_i \in E$ such that $e_i = (v_i, v_{i+1})$ for a sequence of vertices ($v_1, \ldots, v_{n+1}$). Then $p$ is called a path from vertex $v_1$ to vertex $v_{n+1}$ in $G$ and we say that $v_{n+1}$ is reachable from $v_1$, writing $(v_1 \to v_{n+1})$.

Here are some new definitions. A node $v$ in a graph $G = (V, E)$ is called a sink, if for every node $w$ in $G$ that is reachable from $v$, $v$ is also reachable from $w$. The bottom of a graph is the subset of all nodes that are sinks, i.e., $\mathrm{bottom}(G) = \{v \in V \mid \forall w \in V : (v \to w) \Rightarrow (w \to v) \}$. You have to calculate the bottom of certain graphs.

### Input Specification

The input contains several test cases, each of which corresponds to a directed graph $G$. Each test case starts with an integer number $v$, denoting the number of vertices of $G = (V, E)$, where the vertices will be identified by the integer numbers in the set $V = \{1, \ldots, v\}$. You may assume that $1 \le v \le 5000$. That is followed by a non-negative integer $e$ and, thereafter, $e$ pairs of vertex identifiers $v_1, w_1, \ldots, v_e, w_e$ with the meaning that $(v_i, w_i) \in E$. There are no edges other than specified by these pairs. The last test case is followed by a zero.

### Output Specification

For each test case output the bottom of the specified graph on a single line. To this end, print the numbers of all nodes that are sinks in sorted order separated by a single space character. If the bottom is empty, print an empty line.

### Sample Input

3 3
1 3 2 3 3 1
2 1
1 2
0

### Sample Output

1 3
2 Reem Obaid: 2016-03-19 20:35:12 Try this: 3 3 1 2 2 1 2 3 0 output: 3 GAURAV CHANDEL: 2016-02-23 15:41:36 Yes..We All Are Strongly Connected... varun yadav: 2016-01-25 11:19:37 cake walk :) simple scc problem Deepak : 2016-01-24 18:48:57 nice one..AC in one go.. kejriwal: 2015-12-16 19:46:20 nice one !! Saumye Malhotra: 2015-10-24 10:35:27 What is to be done when a graph has multiple bottoms?do we have to print the nodes of bottom with maximum size? If yes, in second case there are two bottoms both of size 1, why is only 2 printed. Someone please help. Thanks in advance. Kushal Saharan: 2015-10-21 06:35:31 For people getting WAs, please keep in mind that reachability doesn't mind the vertices have to be directly connected. Overlooking this costed me 2 WAs. (Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†): 2015-08-18 17:34:28 My first solved SCC problem on dirrected graph ;-) learned something new :-D badry atef: 2015-08-05 15:26:40 a very nice SCC problem :) Medo: 2015-08-05 13:19:05 It's impossible for a graph to have no sink nodes. Don't account for that case if you are getting a WA.