Undirected graph is called complete, if any pair of its different vertices is connected with at least one edge. For a given list of graph edges, check whether it is complete.
The first line contains the number of vertices and the number of edges in the graph. Then pairs of numbers are given — the graph edges.
Print "YES" if the graph is complete and "NO" otherwise.