The auditor Envoy has been asked to prepare the guildmaster's brief. On the desk lies a long table of routes readings. 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 <= 2440; 0 <= m <= 4880; self-edges make the answer NO.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2440; 0 <= m <= 4880; self-edges make the answer NO.
