A directed graph is given with a list of edges. Check whether it contains multiedges.
The first line contains the number of vertices in a graph, (1 \leq n \leq 100), and the number of edges, (1 \leq m \leq 10000). Each of the next lines contains a pair of integers — the edges of the graph.
Print YES if the graph contains multiedges and NO otherwise.

Shembulli 1
Shembulli 2