Deep in the obsidian flows of Blackglass, Envoy studies rows of corridors entries. One clean number will settle the guild's oldest argument. Task: Print YES if the undirected graph's nodes can be split into two groups with no edge inside a group, otherwise NO. Input format: First line: n and m. Next m lines: u v. Output format: Print YES or NO. Constraints: 1 <= n <= 1407; 0 <= m <= 2814; self-edges make the answer NO.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1407; 0 <= m <= 2814; self-edges make the answer NO.
