Esha the auditor watches over the beacon hill of Lantern Tor's stores of bridges. A careful computation stands between order and chaos. 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 <= 2404; 0 <= m <= 2404.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2404; 0 <= m <= 2404.
