#include<bits/stdc++.h>
#define LL long long
#define O4 __inline__ __attribute__((always_inline))
#define inf 0x7fffffff
#define UL unsigned LL
#define LD long double
#ifdef ONLINE_JUDGE
#define getchar nc
#endif
//#define int LL
namespace FastIO{
	O4 char nc(){
		static char buf[100000],*p1=buf,*p2=buf;
		return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
	}
	O4 int read(){
		char t;int u=0,k=1;t=getchar();
		while(t<'0'||t>'9'){if(t==EOF)return -233;if(t=='-')k=-1;t=getchar();}
		while(t>='0'&&t<='9'){u=u*10+t-'0';t=getchar();}
		return u*k;
	}
	template <typename T>
	O4 void read(T &u){
		char t;T k=1;u=0;t=getchar();
		while(t<'0'||t>'9'){if(t=='-')k=-1;t=getchar();}
		while(t>='0'&&t<='9'){u=u*10+t-'0';t=getchar();}
		if(t=='.'){
			T mass=0.1;t=getchar();
			while(t>='0'&&t<='9'){u+=mass*(t-'0');mass/=10;t=getchar();}
		}u*=k;
	}
	O4 int read(char asd[]){
		char t=getchar();int u=0;
		while(t==' '||t=='\n'||t=='\r')t=getchar();
		if(t==EOF)return -1;
		while(t!=' '&&t!='\n'&&t!=EOF&&t!='\r')asd[u++]=t,t=getchar();
		asd[u]='\0';return u;
	}
//	char sr[1<<23],z[23];int C=-1,Z;
//	O4 void wer(int x,char T){
//		int y=0;if(x<0)y=1,x=-x;
//		while(z[++Z]=x%10+'0',x/=10);if(y)z[++Z]='-';
//		while(sr[++C]=z[Z],--Z);sr[++C]=T;
//	}
//	O4 void wer(char T[],char QWQ){
//		for(int i=0;T[i]!='\0';i++)sr[++C]=T[i];
//		sr[++C]=QWQ;
//	}
//	O4 void out(){fwrite(sr,1,C+1,stdout);C=-1;}
}
using namespace std;
using namespace FastIO;
const int N=2005,M=1e6+5;
int n,q,l;
struct sss{
	int a,b,c,num;
}que[M];
int mp[N][N],fa[N],cnt;
bool ans[M],vis[N];
struct ed{
	int a,b,las,nex;
}E[N*2];
char QwQ(){
	char yy=getchar();
	while(yy<48||yy>100)yy=getchar();
	return yy;
}
int QWQ(){
	int yy=(QwQ()-48)*50;
	yy+=QwQ()-48;
	return yy;
}
int get_fa(int x){
	return fa[x]==x?x:fa[x]=get_fa(fa[x]);
}
vector <int> to[N];
void link(int a,int b){
	a=get_fa(a);b=get_fa(b);
	fa[a]=b;
}
int rd[N];
void add_edge(int a,int b){
	++cnt;
	E[cnt].nex=cnt+1;
	E[cnt+1].las=cnt;
	E[cnt].a=a;E[cnt].b=b;
}
void cut_edge(int x){
	E[E[x].las].nex=E[x].nex;
	E[E[x].nex].las=E[x].las;
}
void add(int x){
	memset(rd,0,sizeof rd);
	int a1=0,a2=0,ze=0;
	for(int i=1;i<=n;i++){
		int t=mp[x][i];
		if(rd[t]){
			if(a1)return;
			a1=rd[t];
			a2=i;
		}
		rd[t]=i;
	}
	if(!a1){
		for(int i=1;i<=n;i++)link(i,mp[x][i]);
	}
	else{
		for(int i=1;i<=n;i++)
			if(rd[i]==0)ze=i;
		if(ze==0)exit(233);
		ze=get_fa(ze);
		a1=get_fa(a1);
		a2=get_fa(a2);
		if(a1!=ze)add_edge(a1,ze);
		if(a2!=ze)add_edge(a2,ze);
	}
}
void DFS(int x){
	vis[x]=1;
	for(int i:to[x])
		if(!vis[i])DFS(i);
}
void solve(){
	n=read();l=read();q=read();
	cnt=0;
	E[1].las=0;E[0].nex=1;
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<=l;i++)
		for(int j=1;j<=n;j++)mp[i][j]=QWQ();
	for(int i=1;i<=q;i++){
		que[i].a=QWQ();
		que[i].b=QWQ();
		que[i].c=QWQ();
		que[i].num=i;
	}
	sort(que+1,que+1+q,[](sss a,sss b){return a.c<b.c;});
	int now=0;
	for(int i=1;i<=q;i++){
		while(now!=que[i].c){
			now++;
			add(now);
		}
		memset(vis,0,sizeof vis);
		memset(to,0,sizeof to);
		for(int j=E[0].nex;j!=cnt+1;j=E[j].nex){
			E[j].a=get_fa(E[j].a);
			E[j].b=get_fa(E[j].b);
			if(E[j].a==E[j].b){
				cut_edge(j);
			}
			else to[E[j].a].push_back(E[j].b);
		}
		DFS(get_fa(que[i].a));
		ans[que[i].num]=vis[get_fa(que[i].b)];
	}
	for(int i=1;i<=q;i++)cout<<ans[i];cout<<'\n';
}
signed main(){
	int T=read();
	while(T--)solve();
}