Smzzl with Tropical Taste

A boy, whose ID is smzzl, loves drinking Black Ice Tea(BIT), especially the tropical taste one.

The shop owner knows that, and she prepares a swimming pool so that there would be enough space for her to store BIT. When the boy knows that the owner prepared a swimming pool, he starts to drink in the swimming pool. While the owner is pouring BIT into the swimming pool, the boy is drinking it, too.

Assuming that there are $V$ liters of BIT in the swimming pool, the speed the owner pours BIT is $qV$ liters per second, and the speed the boy drinks BIT is $pV$ liters per second. Note that $V$ changes as the time goes.

Now, the owner wants to know whether the following statement is true:

For any $G>0$, there exists a $T>0$, for any $t>T$, the boy drinks more than $G$ liters of BIT after $t$ seconds.

The input consists of multiple test cases.

The first line contains an integer $T$ ($1 \leq T \leq 100$) -- the number of test cases.

For each test case, there are two decimals $p,q$ ($0 < p,q < 10^4$, they have at most $4$ decimal places) in a single line, $p,q$ are mentioned in the statement. You may regard the initial volume of BIT as $1$ liter, and the swimming pool can contain infinity volume of BIT.

For each test case, output a sentence in a single line.

If the statement is true, output 'N0 M0R3 BL4CK 1CE TEA!'.

If the statement is false, output 'ENJ0Y YOURS3LF!'

2
1.1 2.2
2.05 1.4

N0 M0R3 BL4CK 1CE TEA!
ENJ0Y YOURS3LF!

2021“MINIEYE杯”中国大学生算法设计超级联赛（7）