//ayanami±£ÓÓ£¬¿ä¸ç±£ÓÓ£¬¹·Âè±£ÓÓ£¬MDR±£ÓÓ£¬ï±µ¶¹Ö±£ÓÓ£¬M99±£ÓÓ£¬¿Ëµù±£ÓÓ
#include<bits/stdc++.h>
using namespace std;
int p1=1000000,p2=0;
char buf[1000005],wb[1000005];
int gc() {
	if(p1>=1000000)fread(buf,1,1000000,stdin),p1=0;
	return buf[p1++];
}
#define gc getchar
#define Loli true
#define Kon xor true
long long getint() {
	long long ret=0,flag=1;
	char c=gc();
	while(c<'0'||c>'9') {
		if(c=='-')flag=-1;
		c=gc();
	}
	while(c<='9'&&c>='0') {
		ret=(ret<<3)+(ret<<1)+c-'0';
		c=gc();
	}
	return ret*flag;
}
void pc(char x) {
	if(p2>=1000000)fwrite(wb,1,1000000,stdout),p2=0;
	wb[p2++]=x;
}
void wrt(long long x) {
	if(x<0)pc('-'),x=-x;
	int c[24]= {0};
	if(!x)return pc('0'),void();
	while(x)c[++c[0]]=x%10,x/=10;
	while(c[0])pc(c[c[0]--]+'0');
}
int n,l,Q,t[2005][2005];
char _gc(){char c=gc();while(c<48)c=gc();return c;}
int gt(){return ((_gc()-48)*50)+(_gc()-48);}
struct que{
	int a,b,c,id;
	friend bool operator <(que a, que b){return a.c<b.c;}
}q[1000005];
bool ans[1000005];
int fa[2005];
int get_fa(int x){return x==fa[x]?x:fa[x]=get_fa(fa[x]);}
unordered_set<int> vec[2005];
void Merge(int x,int y){
	x=get_fa(x),y=get_fa(y);
	if(x==y)return;
	if(vec[x].size()<vec[y].size())swap(x,y);
	fa[y]=x;for(int val:vec[y])vec[x].insert(get_fa(val));
}
void dfs(int x,bitset<2005> B[2005],bool vst[2005]){
	if(vst[x])return;
	vst[x]=1,B[x][x]=1;
	for(int y:vec[x])
		dfs(get_fa(y),B,vst),B[x]|=B[get_fa(y)];
}
int dfn[2005],low[2005],sign,s[2005],ins[2005];
void tarjan(int x,vector<pair<int,int>> &R){
	assert(x==get_fa(x));
	dfn[x]=low[x]=++sign,ins[x]=1,s[++s[0]]=x;
	for(int y:vec[x]){
		y=get_fa(y);
		if(!dfn[y])tarjan(y,R),low[x]=min(low[x],low[y]);
		else if(ins[y])low[x]=min(low[x],dfn[y]);
	}
	if(dfn[x]==low[x]){
		int cur=s[s[0]];
		do{R.push_back(make_pair(cur,s[s[0]])),ins[s[s[0]]]=0;}while(s[s[0]--]!=x);
	}
}
int main() {
	int Ti=getint();
	while(Ti--){
		n=getint(),l=getint(),Q=getint();
		for(int i=1;i<=n;i++)fa[i]=i;
		for(int i=1;i<=l;i++)
			for(int j=1;j<=n;j++)t[i][j]=gt();
		
		for(int i=1;i<=Q;i++)
			q[i].a=gt(),q[i].b=gt(),q[i].c=gt(),q[i].id=i;
		
		sort(q+1,q+Q+1);
		int cur=1;
		for(int i=0;i<=l;i++){
			if(i>=1){
				static int d[2005]={0};
				for(int j=1;j<=n;j++)d[j]=0;
				for(int j=1;j<=n;j++)++d[t[i][j]];
				int num[3]={0};
				for(int j=1;j<=n;j++){
					if(d[j]==0)++num[0];
					if(d[j]==1)++num[1];
					if(d[j]>=2)++num[2];
				}
				if(num[1]==n){
					for(int j=1;j<=n;j++){
						int x=j,y=t[i][j];
						Merge(x,y);
					}
				}
				if(num[1]==n-2){
					for(int j=1;j<=n;j++)if(d[j]==0)num[0]=j;
					for(int j=1;j<=n;j++)
						if(d[t[i][j]]==2)vec[get_fa(j)].insert(get_fa(num[0]));
				}
			}
			if(q[cur].c==i){
				static bitset<2005> B[2005];
				static bool vst[2005];
				sign=0,s[0]=0;
				for(int i=1;i<=n;i++)dfn[i]=low[i]=0;
				vector<pair<int,int>> R;
				for(int i=1;i<=n;i++)if(get_fa(i)==i&&!dfn[i])tarjan(i,R);
				for(auto p:R)Merge(p.first,p.second);
				for(int i=1;i<=n;i++)if(get_fa(i)==i)dfs(i,B,vst);
				
				while(q[cur].c<=i&&cur<=Q)
					ans[q[cur].id]=B[get_fa(q[cur].a)][get_fa(q[cur].b)],++cur;
				
				for(int i=1;i<=n;i++)B[i].reset(),vst[i]=0;
			}
		}
		for(int i=1;i<=Q;i++)wrt(ans[i]);
		pc('\n');
		
		for(int i=1;i<=n;i++)vec[i].clear();
	}
	fwrite(wb,1,p2,stdout);
	return Loli Kon;
}