Question
Exploring the Continents
In the kingdom of Graphoria, there are KaTeX can only parse string typed expression cities connected by KaTeX can only parse string typed expression bidirectional roads.
Some cities are connected directly, while others can only be reached through a series of intermediate cities.
Your task is to help the Royal Explorer determine the size of the largest group of interconnected cities — that is, the largest connected component in the kingdom’s road network.
Input
The first line contains two integers KaTeX can only parse string typed expression and KaTeX can only parse string typed expression — the number of cities and roads, respectively.
The next KaTeX can only parse string typed expression lines each contain two integers KaTeX can only parse string typed expression and KaTeX can only parse string typed expression, indicating that there is a two-way road between city KaTeX can only parse string typed expression and city KaTeX can only parse string typed expression.
The next KaTeX can only parse string typed expression lines each contain two integers KaTeX can only parse string typed expression and KaTeX can only parse string typed expression, indicating that there is a two-way road between city KaTeX can only parse string typed expression and city KaTeX can only parse string typed expression.
Output
Print a single integer — the size of the largest group of cities that are all reachable from one another.
Example
Input:
7 4
0 1
2 3
3 4
5 6
Output:
3
Explanation:
In the kingdom of Graphoria, there are 7 cities and 4 roads.
The road map forms the following groups of connected cities:
[0, 1]
[2, 3, 4]
[5, 6]
The largest group is [2, 3, 4], which contains 3 cities.
7 4
0 1
2 3
3 4
5 6
Output:
3
Explanation:
In the kingdom of Graphoria, there are 7 cities and 4 roads.
The road map forms the following groups of connected cities:
[0, 1]
[2, 3, 4]
[5, 6]
The largest group is [2, 3, 4], which contains 3 cities.