An undirected graph is called regular if all its vertices have the same degree.
Given the list of edges of a graph, determine whether the graph is regular.
The first line contains two integers: n~(1 \le n \le 100) — the number of vertices, and m~(0 \le m \le \frac{n(n-1)}{2}) — the number of edges in the graph. Each of the next lines contains two integers — the endpoints of an edge.
Print "YES" if the graph is regular, and "NO" otherwise.

1-nji mysal
2-nji mysal