#include<iostream>
#include<algorithm>
#include<stack>
#include<string.h>
#include<map>
#include<vector>
using namespace std;
int m[55];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        vector<int>s[55];
        memset(m,0,sizeof(m));
        memset(s,0,sizeof(s));
        int sum;
        map<int,int>mp;
        int n,a,b;
        cin>>n;
        sum=n;
        for(int i=1;i<=n;i++)
        {
            cin>>a;
            mp[a]=i;
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                cin>>b;
                s[i].push_back(b);
            }
        }
           if(s[mp[1]][0]==mp[1])
           {
               cout<<"lieren"<<endl;
           }
           else
           {
                   int i;
                   m[s[mp[1]][0]]=1;
                   int flag=1;
                   sum--;
                   int t=s[mp[1]][0];
                  while(sum>2&&flag)
                  {
                         for(i=0;i<s[t].size();i++)
                         {
                                 if(!m[s[t][i]])
                                 {
                                      sum--;
                                      if(s[t][i]==mp[1])
                                      {
                                           flag=0;
                                           break;
                             }
                             else
                             {
                                 m[s[t][i]]=1;
                                 break;
                             }
                         }
                    }
                    t=s[t][i];
               }
               if(flag==0)
               {
                   cout<<"lieren"<<endl;
               }
               else if(sum<=2)
               {
                   cout<<"langren"<<endl;
               }
           }
    }
}