#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;

int n;
int isbad[50];
bitset<50>islive;
queue<int>Q[50];

int solve(){
    int wolf=max_element(isbad,isbad+n)-isbad;
    islive.set();
    int live=n;
    queue<int>die;
    while(true){
        if(die.size()){
            auto q=die.front();
            die.pop();
            while(Q[q].size()&&!islive[Q[q].front()])Q[q].pop();
            if(Q[q].empty())continue;
            auto p=Q[q].front();
            Q[q].pop();
            islive.reset(p);
            die.push(p);
            live--;
            if(p==wolf)return true;
            else if(live<=2)return false;
        }
        else{
            while(Q[wolf].size()&&!islive[Q[wolf].front()])Q[wolf].pop();
            if(Q[wolf].empty())break;
            auto p=Q[wolf].front();
            Q[wolf].pop();
            islive.reset(p);
            die.push(p);
            live--;
            if(p==wolf)return true;
            else if(live<=2)return false;
        }
    }
    return false;
}

int main(){
    int t;cin>>t;
    while(t--){
        scanf("%d",&n);
        for(int i=0;i<n;i++)scanf("%d",isbad+i);
        for(int i=0;i<n;i++)while(Q[i].size())Q[i].pop();
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++){
                int k;
                scanf("%d",&k);
                Q[i].push(k-1);
            }
        if(solve())puts("lieren");
        else puts("langren");
    }
}