It is audit day at the lotus ponds of Tranquil Basin. Vani spreads the routes records across the table and picks up a sharp pencil. 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 <= 1996; 0 <= m <= 1996.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1996; 0 <= m <= 1996.
