Infinite Planes
Easy
Execution time limit is 0.5 seconds
Runtime memory usage limit is 64 megabytes
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
First line contains the number of test cases t (1 ≤ t ≤ 1000). In each line you are given n - the number of lines and k - the number of infinite area (1 ≤ n, k ≤ 10^9).
Output
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 #1
Answer #1
Submissions 21
Acceptance rate 14%