In the pearl fisheries of Nacre Bay, Dante the bookkeeper keeps careful count of the tunnels. Verify the ledger before the auditors arrive, every figure matters. 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 <= 2201; 0 <= m <= 4402; self-edges make the answer NO.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2201; 0 <= m <= 4402; self-edges make the answer NO.
