Caravans arrive at the copper works of Verdigris with crates of bridges, and Maya the reckoner must account for every last one. 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 <= 2721; 0 <= m <= 2721.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2721; 0 <= m <= 2721.
