SOLVE
LATER
Sherlock wanted to have some fun and decided to visit Paris. An elderly man whom he met there wanted Sherlock to solve his problem and so he began -
For a graph G, the roads, which on deletion do not disconnect the graph are compressed into a node and the roads which on deletion disconnect the graph form an edge between these nodes. The resultant structure will be a tree of course! You have to help Sherlock by printing the number of edges and diameter of this tree.
Input Format
First line contains $$N$$ and $$M$$, the number of nodes and edges respectively.
Next M lines contain two space separated integers $$u$$ and $$v$$, denoting there is an edge between these two nodes.
Constraints
Output Format
Print two space separated integers denoting the number of edges in the tree formed and diameter of the tree.