#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (1500+100) 
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}


int k;
const char s1[]="You will fail some exam ,but I think I can deal with it.\n";
const char s2[]="I've got it by using my IQ and RP.\n";
const char s3[]="It's too easy.I've found many solutions in my first glance.\n";

int n,indegree[MAXN];
int f[MAXN][MAXN];
bool b[MAXN];
int q[MAXN*4];
void topsort()    
{    
    int head_=1,tail=0;
	int fl=0,flm=0;    
    Fork(i,1,n)  
        if (indegree[i]==0)     
        {    
            q[++tail]=i;b[i]=1; ++fl;    
        }    
    if (fl>1) flm=1;
    
    while (head_<=tail)    
    {    
    	fl=0;
        int now=q[head_];    
        Fork(v,1,n)  
            while (f[now][v])  
            {    
                indegree[v]--;f[now][v]--;    
                if (indegree[v]==0)    
                {    
                    q[++tail]=v;b[v]=1; ++fl;    
                }                                       
            }       
        head_++;    
        
		if (fl>1) flm=1;
            
            
    }         
    if (tail==n)   
    {
    	if (flm) printf("%s",s3); 
    	
	    else 
		{
			printf("%s",s2); 
			printf("%d",q[1]);
			Fork(i,2,n) printf(" %d",q[i]);
			printf("\n");  
    
		}
	}
	else printf("%s",s1);  
      
}    

int main()
{
//	freopen("D.in","r",stdin);
//	freopen(".out","w",stdout);
	
	
	while(scanf("%d%d",&n,&k)==2)
	{
		MEM(f) MEM(indegree) MEM(q) MEM(b)
		For(i,k)
		{
			int p,p2;
			scanf("%d",&p);
			while(scanf("%d",&p2)==1)
			{
				if (f[p2][p]) continue; 
				if (p2) f[p2][p]++,indegree[p]++;
				else break;
			}
		}	
		
		topsort();
			
	}
	return 0;
}