Given an undirected graph with v vertices and e edges, you are asked to find its heaviest vertex. The “heaviness” of a vertex is measured by the number of connections. The more neighbors it has - the heavier the vertex. If several vertices have the same heaviest weight, you should return the one with the smallest number.
The first line of the input contains two integers v (1 ≤ v ≤ 1000) and e (1 ≤ e ≤ 100 000).
The following e lines contain pairs of integers v1, v2 (1 ≤ v1, v2 ≤ v) which means that the vertex v1 is connected to the vertex v2 and vice versa.
The program should print the smallest index of the vertex with the heaviest weight.