Every season at the windmill fields of Gusthaven, someone must audit the season's records. This year the task falls to Cyrus, armed only with the canals register. 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 <= 1866; 0 <= m <= 3732; self-edges make the answer NO.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1866; 0 <= m <= 3732; self-edges make the answer NO.
