#include<cstdio>
#include<algorithm>
using namespace std ;
#define MAX 10002
int main ()
{
int t , arr1[MAX] , arr2[MAX] , i , j , n , m ;
scanf ("%d",&t) ;
while (t--)
{
scanf ("\n") ;
scanf ("%d %d",&n,&m) ;
for (i= 0 ; i<n ; i++)
scanf ("%d",&arr1[i]) ;
for (j = 0 ; j<m ; j++)
scanf ("%d",&arr2[j]) ;
sort (arr1 , arr1+n) ;
sort (arr2 , arr2+m) ;
i = 0 ; j = 0 ;
while (1)
{
if (arr1[i] >= arr2[j])
j++ ;
else if (arr1[i] < arr2[j])
i++ ;
if (i == n )
{
printf ("MechaGodzilla
\n") ;
break ;
}
if (j == m )
{
printf ("Godzilla\n") ;
break ;
}
}
if (i != n && j!= n)
printf ("unpredictable\n") ;
}
return 0 ;
}
I2luY2x1ZGU8Y3N0ZGlvPgojaW5jbHVkZTxhbGdvcml0aG0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkIDsgCiNkZWZpbmUgTUFYIDEwMDAyCgppbnQgbWFpbiAoKQp7CglpbnQgdCAsIGFycjFbTUFYXSAsIGFycjJbTUFYXSAsIGkgLCBqICwgbiAsIG0gOyAKCXNjYW5mICgiJWQiLCZ0KSAgOwoJd2hpbGUgKHQtLSkKCXsKCQlzY2FuZiAoIlxuIikgIDsgCgkJc2NhbmYgKCIlZCAlZCIsJm4sJm0pICA7IAoJCWZvciAoaT0gMCA7IGk8biA7IGkrKykKCQkJc2NhbmYgKCIlZCIsJmFycjFbaV0pICA7IAoJCWZvciAoaiA9IDAgOyBqPG0gOyBqKyspCgkJCXNjYW5mICgiJWQiLCZhcnIyW2pdKSAgOyAKCQlzb3J0IChhcnIxICwgYXJyMStuKSAgOyAKCQlzb3J0IChhcnIyICwgYXJyMittKSA7IAoJCQoJCWkgPSAwICA7IGogPSAwIDsgCgkJd2hpbGUgKDEpCgkJewoJCQlpZiAoYXJyMVtpXSA+PSAgYXJyMltqXSkgCgkJCQlqKysgOyAKCQkJZWxzZSBpZiAoYXJyMVtpXSA8IGFycjJbal0pCgkJCQlpKysgOwoJCQlpZiAoaSA9PSBuICkKCQkJewoJCQkJcHJpbnRmICgiTWVjaGFHb2R6aWxsYQoKXG4iKSAgOyAKIAkJCQlicmVhayA7IAoJCQl9CgkJCWlmIChqID09IG0gKQoJCQl7CgkJCQlwcmludGYgKCJHb2R6aWxsYVxuIikgOyAKCQkJCWJyZWFrIDsgCgkJCX0KCQkJIAkgCgkJfQoKCQlpZiAoaSAhPSBuICYmIGohPSBuKQoJCQlwcmludGYgKCJ1bnByZWRpY3RhYmxlXG4iKSA7IAoJCQoJCQoJfQpyZXR1cm4gMCA7IAp9