The council of the fen lights of Will-o-Wisp pays by the answer, and Sarla intends to earn it. First: the full register of tunnels. Task: An undirected graph has n nodes and m edges. Print the number of connected components. Input format: First line: n and m. Next m lines: u v. Output format: Print the component count. Constraints: 1 <= n <= 1482; 0 <= m <= 2964; 1 <= u,v <= n.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1482; 0 <= m <= 2964; 1 <= u,v <= n.
