### No Brainer

Time Limit: 1000 ms
Memory Limit: 65536 KiB

#### Problem Description

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.

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".

#### Sample Input

3 4 5 3 3 4 3

#### Sample Output

NO BRAINS MMM BRAINS MMM BRAINS

#### Hint

#### Source

面向对数据结构和算法不太了解的同学