#include <iostream>

 #include <cstring>

 #include <cstdio>

 using namespace std;

 const int MAXN=;

 const int MAXM=;

 int n,m;

 struct d{

     int u,v;

 }sv[];

 int dfn[MAXN],low[MAXN],st[MAXN],tot,stop,pat,indx,belong[MAXN];

 bool stack[MAXN];

 struct e{

     int u,v;

     int next;

 }edge[MAXM];

 int head[MAXN];

 void addedge(int u,int v){

     edge[tot].u=u;

     edge[tot].v=v;

     edge[tot].next=head[u];

     head[u]=tot++;

 }

 void exch(int &x,int &y){

     if(x>y){

         int tmp=y;

         y=x;

         x=tmp;

     }

 }

 bool sure(int i,int k){

     int u=sv[k].u;

     int v=sv[k].v;

     int p=sv[i].u;

     int q=sv[i].v;

     if(p>=u&&p<=v&&q>=u&&q<=v)

     return false;

     if(p>=v) return false;

     if(q<=u) return false;

     if(p<=u&&q>=v) return false;

     return true;

 }

 void tarjan(int u){

     dfn[u]=low[u]=++indx;

     stack[u]=true;

     st[stop++]=u;

     int v;

     for(int e=head[u];e!=-;e=edge[e].next){

         v=edge[e].v;

         if(dfn[v]==){

             tarjan(v);

             low[u]=min(low[u],low[v]);

         }

         else if(stack[v]){

             low[u]=min(low[u],dfn[v]);

         }

     }

     if(dfn[u]==low[u]){

         pat++;

         do{

             v=st[--stop];

             belong[v]=pat;

             stack[v]=false;

         }while(u!=v);

     }

 }

 int main(){

     int u,v;

     while(scanf("%d%d",&n,&m)!=EOF){

         tot=indx=pat=stop=;

         for(int i=;i<m*;i++){

             dfn[i]=low[i]=belong[i]=;

             stack[i]=false; head[i]=-;

         }

         for(int i=;i<m;i++){

             scanf("%d%d",&sv[i].u,&sv[i].v);

             exch(sv[i].u,sv[i].v);

             if(i>){

                 for(int k=;k<i;k++){

                     if(sure(i,k)){

                         addedge(*i,*k+);

                         addedge(*k,*i+);

                         addedge(*i+,*k);

                         addedge(*k+,*i);

                     }

                 }

             }

         }

         for(int i=;i<*m;i++)

         if(dfn[i]==)

         tarjan(i);

         bool flag=true;

         for(int i=;i<m;i++){

             if(belong[i*]==belong[*i+]){

                 flag=false;

                 printf("the evil panda is lying again\n");

                 break;

             }

         }

         if(flag)

         printf("panda is telling the truth...\n");

     }

     return ;

 }