Course Schedule II (Topological Order)

Each line 'a b' means course b must be taken before course a. Print a valid order to finish all n courses. If several orders exist, always take the smallest available course number first. Print -1 if it is impossible.

1 <= n <= 2000 0 <= m <= 5000