*The UPC programming competition is twenty years old!
This implies that many of the participants of today’s contest were not even born
when the pioneers of the UPC teams trained with a (relatively) young Prof. Oak.
*

*What follows is an example of the extreme difficulty of the problems during the good old days.
It is from the South Central USA ICPC Regional 2004.
*

*******************************************************************

Zombies love to eat brains. Yum.

Input

The first line contains a single integer n indicating the number of data sets. The following n lines each represent a data set. Each data set will be formatted according to the following description: A single data set consists of a line X Y, where X is the number of brains the zombie eats and Y is the number of brains the zombie requires to stay alive.

Output

For each data set, there will be exactly one line of output. This line will be “MMM BRAINS” if the number of brains the zombie eats is greater than or equal to the number of brains the zombie requires to stay alive. Otherwise, the line will be “NO BRAINS”.

*******************************************************************

*One observation about the test cases:
Assume that both *X* and *Y* are between 0 and *10^{10000}*.
*

Public test cases

**Input**

3 4 5 3 3 4 3

**Output**

NO BRAINS MMM BRAINS MMM BRAINS

Information

- Author
- Salvador Roura
- Language
- English
- Official solutions
- C++ Python
- User solutions
- C++ Python Rust