Undirected graph is called regular, if all its vertices have the same degree.
Graph is given by list of edges. Check, is it regular.
First line contains number of vertices and number of edges in a graph. Then given pairs of numbers — the edges of graph.
Print "YES" if graph is regular and "NO" otherwise.