// MC0226 双人成行 码蹄杯~~~~~
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
const int N = 11111;
set<int> vs;
int n,x,y,p1[N],p2[N];
int main()
{
cin>>n;
cin>>x;
for(int i=0;i<x;i++)
{
cin>>p1[i];
vs.insert(p1[i]);
}
cin>>y;
for(int i=0;i<y;i++)
{
cin>>p2[i];
vs.insert(p2[i]);
}
int len = vs.size();
if(len == n)
cout<<"It Takes Two."<<endl;
else
cout<<"Maybe Next Time."<<endl;
return 0;
}