Count and Largest SCC

**Bài toán.** Line 1: n m; then m directed edges u v. Print two numbers: the number of strongly connected components and the size of the largest one. **Constraints:** 1 ≤ n, m ≤ 200 000. Iterative Kosaraju, O(n + m). Treating the graph as undirected fails exactly when direction matters.