Garfield had been pretty lazy, now he make some plans as follow:
Garfield at most do M(1 <= M <= 200) things in one day.
There are N (1 <= N <= 500) things to finsh
For each thing, It need Nt days to finsh it, The Nt days can pick up during the day St to day Et. the St, Et, Nt(1<=St < Et <= 500, Nt <= Et - St)
Can he finish these?

First line contain a integer T (T <= 20), means the test case;
For each test case, There are two integers N, M in first line;
The flowing N lines contain three integers St, Et, Nt;

For each test case, if Garfield can finish all the things, print "Yaha, Garfield, You Finish it!", or print "Oh~~Garfield, You are just as before!";