For a given undirected graph with N vertices and M edges
you need to figure out whether the graph is bipartite or no.

NOTE. A graph is called bipartite if it's possible
to split its vertices into two non-empty sets so that there is no edges
between any two vertices from the same set.

Input file format

Input file contains integers N, M, then M
pairs of integers a_{i}b_{i}
describing the edges of the graph.

Output file format

Output BIPARTITE if the graph is bipartite or NO if it is not.