Maximum and minimum connected component

Given an undirected graph, compute the number of vertices of the smallest and largest connected component.

Input

Input consists of several graphs. Each of them starts with the number of vertices $n$ and the number of edges $m$ , followed by $m$ pairs $x$ $y$ that correspond to an edge between vertices $x$ and $y$ . It holds that $1 \le n \le 10^4$ , $0 \le m \le 5n$ , vertices are numbered from $0$ to $n-1$ , and there are neither repeated edges nor edges of the form $x$ $x$ .

Output

For each graph, write the minimum and maximum size of its connected components.

Problem information

Author: Salvador Roura

Generation: 2026-01-25T22:04:35.504Z