Influenza AH1N1
Any epidemic is dangerous. And the more an epidemic of highly communicable diseases such as influenza. Therefore, governments of almost all countries are developing plans for special events in case of epidemics. One of the most effective measures in the epidemic is to isolate the diseased. At the same time across the country may have to isolate the entire city (what to do within each of the isolated city, city council decides to let this city). It is obvious that in case of isolation of the city to keep all communication between the other cities. Naturally, if the communication is not saved, you need to build new roads (preferably as little as possible).
President of a country with a developed network of roads led your team to assess the situation. He asked to determine whether the communication will remain between all the cities (we assume that in this country, the communication between all the cities beginning of time), if one isolate any city (ie, blocking all roads leading to it). However, if there is at least one city, which violates the exclusion of communication is necessary to determine if there is enough to build just one way that the insulation does not violate any city communications. Since information on all the roads of the country is strategic, the president does not have a network of roads the names of cities, but simply to number them.
Input
In the first line through the gap through two integers (N - number of cities, 2 ≤ N ≤ 20000 and M - number of roads, 1 ≤ M ≤ 200000). Thus two cities can only connect one way.
Next M lines, each containing two integers through space - number of cities connected by road.
Output
If the exclusion of any city with the construction of not more than one road is possible, in a single line of text to give YES, otherwise the line to withdraw NO.
If the possibility of isolation of any city to build only one road, then through the gap to bring the number 1.