#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
inline int read(){
	int x=0,f=1;char ch=getchar();
	for(;'0'>ch||ch>'9';ch=getchar())if(ch=='-')f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar())x=(x<<3)+(x<<1)+(ch^48);
	return x*f;
}
const int N=2e4,M=2e6,inf=5e17;
inline void Max(int&x,int y){if(x<y)x=y;}
struct mt{
	int a[8][8],b[8][8];
	inline void rd(){
		f(i,1,n)f(j,1,m)a[i][j]=read();
		f(i,1,n)g(j,m+1,1)b[i][j]=j>m?0:(b[i][j+1]+a[i][j]);
	}
}A[N],B[N];
int f[9][N],o[N],p[N],q[M];
inline void de(int S){S=p[S];g(i,n,1)o[i]=S&7,S>>=3;}
inline int en(int S=0){f(i,1,n)S=(S<<3)|o[i];return q[S];}
void dfs(int x,int y,int z){
	if(!x)return p[q[z]=++s]=z,void();
	for(;y;--y)dfs(x-1,y,(z<<3)|y);
}
inline void doing(){
	int k=read();n=read();m=read();
	s=0;dfs(n,m+1,0);
	f(i,1,k)A[i].rd();
	f(i,1,k)B[i].rd();
	f(S,1,s)f[0][S]=S>1?0:inf;
	f(_,1,k){
		mt a=A[_],b=B[_];
		f(i,1,n){
			f(S,1,s)f[i][S]=0;
			f(S,1,s){
				de(S);
				g(p,o[i],1)if(p==o[i]||a.a[i][p]){
					f(j,i,n)o[j]=min(o[j],p);
					Max(f[i][en()],f[i-1][S]+a.b[i][p]-b.b[i][p]);
				}
			}
		}
		f(S,1,s)f[0][S]=f[n][S];
	}
	f(S,1,s)if(f[0][S]>inf)return printf("NIE\n"),void();
	printf("TAK\n");
}
signed main(){
	int t=read();
	while(t--)doing();
	return 0;
}