#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

//#include <atcoder/convolution>
//#include <atcoder/modint> 
//using Modint = atcoder::modint998244353;

using namespace std;
typedef long long ll;

void ex_gcd(ll a, ll b, ll &d, ll &x, ll &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    ex_gcd(b, a % b, d, y, x);
    y -= a / b * x;
  }
}
ll inv(ll a, ll n) {
  ll d, x, y;
  ex_gcd(a, n, d, x, y);
  return d == 1 ? (x % n + n) % (n / d) : -1;
}
ll gcd(ll x, ll y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}

int gcd(int x, int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}

inline void scan_d(int &ret) {
    char c; ret=0;
    while((c=getchar())<'0'||c>'9');
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
}

const int maxn = 55;
const int mod = 998244353;

int a[maxn][maxn];

int main() {
#ifdef suiyuan2009
  freopen("/Users/suiyuan2009/CLionProjects/icpc/input.cpp", "r", stdin);
  freopen("/Users/suiyuan2009/CLionProjects/icpc/output.cpp", "w", stdout);
#endif
  int T;
  cin>>T;
  while(T--){
    int n;
    scan_d(n);
    int idx = 0;
    for(int i=1;i<=n;i++){
      int x;
      scan_d(x);
      if(x==1){
        idx = i;
      }
    }
    for(int i=1;i<=n;i++){
      for(int j=1;j<=n;j++){
        scan_d(a[i][j]);
      }
    }
    int lft = n;
    ll mask = 0;
    int cur = idx;
    while(1){
      for(int i=1;i<=n;i++){
        if(!(mask&(1LL<<(a[cur][i])))){
          lft--;
          mask|=(1LL<<a[cur][i]);
          cur=a[cur][i];
          break;
        }
      }
      if(idx==cur){
        printf("lieren\n");
        break;
      } else if(lft<=2){
        printf("langren\n");
        break;
      }
    }
  }
  return 0;
}