Deep in the quartz ridge of Glimmerfell, Darian studies rows of roads entries. One clean number will settle the guild's oldest argument. 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 <= 1036; 0 <= m <= 1036.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1036; 0 <= m <= 1036.
