The council of the lantern district of Glowfen pays by the answer, and Kavi intends to earn it. First: the full register of tunnels. 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 <= 3010; 0 <= m <= 6020; self-edges make the answer NO.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3010; 0 <= m <= 6020; self-edges make the answer NO.
