eolymp
bolt
Try our new interface for solving problems
Problems

Infinite Planes

Infinite Planes

Time limit 0.5 seconds
Memory limit 64 MiB

Now, our hero is working on infinite planes. He has recently found that if lines satisfies some conditions, then some of the planes are infinite others are closed area. He is presenting a new simple and interesting problem.

You have n lines. You are interested in that you could build k infinite area using n lines or not. Assume that you build different set of lines.

Input data

First line contains the number of test cases t (1t1000). In each line you are given n - the number of lines and k - the number of infinite area (1n, k10^9).

Output data

DEcide, whether you could build k infinite area using n lines, or not. If yes, output “Etibar is happy”, otherwise output “No matter” without quotes.

Examples

Input example #1
1
2 4
Output example #1
Etibar is happy
Author Mahammad Valiyev
Source Local Contest #2 Qafqaz University by Mahammad Valiyev