The council of the honeycomb cliffs of Beeswick pays by the answer, and Marek intends to earn it. First: the full register of routes. Task: Print YES if the directed graph contains a cycle, otherwise NO. Input format: First line: n and m. Next m lines: u v (directed). Output format: Print YES or NO. Constraints: 1 <= n <= 3896; 0 <= m <= 3896.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3896; 0 <= m <= 3896.
