beecrowd | 1903

Food Chain

By Thalyson Nepomuceno, Universidade Estadual do Ceará BR Brazil

Timelimit: 2

While Bino was traveling, he drew some food chains of living organisms of Binox. However, Bino noted in some chains that all pairs of species relate (directly of indirectly). He called these chains as Cadeias Boladas.

Representing the food chain as a graph, all pairs of species (u, v) relate if exist a path from u to v OR a path from v to u.

From a food chain, Bino wants to know if it a Cadeia Bolada or Nao Cadeia Bolada.


The input consists of multiple rows. The first row has two integers N (1 ≤ N ≤ 100000) and M (1 ≤ M ≤ 1000000), representing the amount of species and the number of relationships, respectively. The following M rows have two integers U (1 ≤ UN) and V (1 ≤ VN), representing the existence of an unidirectional relationship between U and V.


Print out one row with the message “Bolada” (no quotes) if the chain is a Cadeia Bolada, or “Nao Bolada”, otherwise.

Input Samples Output Samples

3 3
1 3
2 3
3 1


3 2
1 3
2 3

Nao Bolada