Fire drill

A fire drill must empty $N$ buildings. Each building has a document that lists building numbers that must be evacuated before it. When a building is evacuated while at least one listed predecessor is still occupied, one penalty is added. Find an evacuation order that minimizes the number of penalties.

The first line contains three integers $T$, $N$, and $S$. $T$ is the test index, $N$ is the number of buildings, and $S$ is the fault threshold used in evaluation. Buildings are numbered from $1$ to $N$.

Each of the next $N$ lines describes one document. On the $i$-th line, the first integer is how many buildings appear in building $i$'s document, followed by those building numbers. No two buildings appear in each other's documents. No document lists itself, and no number repeats within a document.

Print $N$ lines, each with one building number. The first line is evacuated first, then the second, and so on. Every building appears exactly once.

$N = 1000$