SCC Count, Size, Condensation

**Bài toán.** Line 1: n m. Then m directed edges u v (1-based). Print three numbers on one line: the NUMBER of strongly connected components, the SIZE of the largest component, and the number of DISTINCT edges in the condensation (pairs (comp[u], comp[v]) with comp[u] != comp[v], each counted once). **Constraints:** 1 ≤ n, m ≤ 200 000. Iterative Kosaraju in O(n + m); the condensation deduplicates.