Biggest network

Problem

A company has n computers and m two-way cables. Print the number of computers in the largest network, where a network is a group of computers that can reach each other.

Input, output and limits

Input: Line 1: n and m, the number of nodes and edges. Then m lines, each with two node numbers a and b for a two-way link. Nodes are numbered 0 to n - 1.
Output: One integer: the size of the largest network.
Constraints: 1 ≤ n ≤ 100000
0 ≤ m ≤ 200000
No node is linked to itself and no pair is listed twice

Examples

Example

Input

Output

Hints

Try the problem first. Open one hint at a time.

Hint 1

Count the nodes of each network while you search it.

Hint 2

Keep the largest count.

Write your Python code, run it on the examples and submit it to hidden tests.

Solve in the editor

Paint bucketeasy
Loop in the cablingmedium
How far does the news spread?easy
Tasks that wait for each othermedium
Count the land patcheseasy

All Python problems

Problem

Input, output and limits

Examples

Hints

More Graphs: Basics & Traversal problems

Problem

Input, output and limits

Examples

Hints

More Graphs: Basics & Traversal problems