The council of the thorn maze of Bramblecourt pays by the answer, and Nina intends to earn it. First: the full register of bridges. 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 <= 2346; 0 <= m <= 2346.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2346; 0 <= m <= 2346.
