Find Eventual Safe Nodes

A node is safe if every path from it ends at a terminal node (no outgoing edges) rather than entering a cycle. Print all safe nodes in increasing order. Nodes are 0-indexed; each line lists the out-neighbours of a node.

1 <= n <= 10^4