Minimum and maximum connected component

Input

The first line contains two positive integers $n$ and $m$ $(1 \leq n, m \leq 10000)$ (1 \leq n, m \leq 10000) — the number of vertices and edges of the graph. Each of the following $m$ lines contains two integers $a_{i}$ a_i and $b_{i}$ b_i $(1 \leq a_{i}, b_{i} \leq n)$ (1 \leq a_i, b_i \leq n) — the description of an undirected edge.

Output

Print on one line the size of the smallest and largest connected components of the graph.

Examples

Example 1

Loading