A directed graph is called a tournament if there is exactly one edge between any pair of its different vertices. Graph is given by the list of edges. Check if it is a tournament.
The first line contains number of vertices and number of edges in the graph. The next lines contain the pairs of numbers — the edges of the graph.
Print "YES" if graph is tournament and "NO" otherwise.