#include <bits/stdc++.h>

#define cs(n) scanf("%d", &n)
#define F(i, j, k) for(int i = j; i <= k; ++i)
#define R(i, j, k) for(int i = j; i >= k; --i)

using namespace std;
using ll = long long;
const int MAXN = 52;
const int INF = 0x3f3f3f3f;

int die[MAXN];
int a[MAXN][MAXN];

int get(int id, int n) {
    int cnt = 0;
    F(i, 1, n) {
        if(!die[i]) ++cnt;
    }
    return cnt;
}

int main() {
    int T; cs(T);
    while(T--) {
        int n; cs(n);
        int id, x;
        F(i, 1, n) {
            cs(x); die[i] = 0;
            if(x == 1) id = i;
        }
        
        F(i, 1, n) F(j, 1, n) cs(a[i][j]);
        int now = 1, flag = 0;
        
        while(now <= n) {
            
            while(now <= n && die[a[id][now]]) ++now;
            
            if(a[id][now] == id) { flag = 2; break; }
            die[a[id][now]] = 1;
            int i = a[id][now];
            
            while(flag == 0) {
                
                if(get(id, n) <= 2) { flag = 1; break; }
                
                int j = 1;
                while(j <= n && (die[a[i][j]] || a[i][j] == i)) ++j;
                
                if(a[i][j] == id) { flag = 2; break; }
                
                die[a[i][j]] = 1;
                i = a[i][j];
                
            }
            
            if(flag) break;
            
            ++now;
        }
        
        puts(flag == 1 ? "langren" : "lieren");
    }
     return 0;
}