Problem 1034. -- Mr. Nartrosh

1034: Mr. Nartrosh

Time Limit: 1 Sec  Memory Limit: 64 MB
Submit: 12  Solved: 3
[Submit][Status][Web Board]

Description

暑假ACM集训的某一天,Mr. Nartrosh and Dr. Firepot 正在切题,其中有一个题目非常的有意义,当时他俩就这个题目讨论了很久,所以对于这道题目一直记忆犹新,于是他俩准备把这个题目推荐给你们,鉴于保持原汁原味,他俩准备不作修改的把这个题目告诉大家,让你们来分享他们当时的成就感?,题目描述是这样的:
Zombies love to eat brains. Yum.
We give two number “x, y”, x is the number of brains, y is the number of the brains the zombie requires to stay alive. Tell him “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, tell him "NO BRAINS".

Input

第一行一个正整数n(0 < n < 100),表示接下来有n组数据:
接下来每一行两个正整数x, y(0 < x,y < 10100),输入数据保证x和y的最高位非0。

Output

一共n行,每一行输出”MMM BRAINS” or “NO BRAINS”。

Sample Input

3
4 5
3 3
4 3

Sample Output

NO BRAINS
MMM BRAINS
MMM BRAINS

HINT

Source

[Submit][Status]