Given graph, find out the minimum number of edges that have to be deleted so that the given graph becomes disconnected.
The first line of input contains two integers 2 ≤ N ≤ 1000 (the number of vertices) and 1 ≤ M ≤ 2000 (the number of edges).
The following M lines describe the connections
link to the original: http://olymp.krsu.edu.kg/GeneralProblem.aspx?problem=159&format=html
Thanks in advance