#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e3+5,M=1e7+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,l,q;
int g[N],A[N],B[N];
int read(){
	char c=Gc();
	while(c<48||c>98) c=Gc();
	return (c-48)*50+Gc()-48;
}
vector<tuple<int,int,int>> Q[N];int ans[N*N];
int op[N],X[N],Y[N],Z[N],p[N][N],f[N][N];
vector<int> S1[N],S2[N];
void modify(int x,int y){
	gdb(x,y);f[x][y]=1;
	for(int i:S2[x]) if(!f[i][y]) modify(i,y);
	for(int i:S1[y]) if(!f[x][i]) modify(x,i);
}
void con(int x,int y){
	if(f[x][y]) return;
	S1[x].push_back(y);
	S2[y].push_back(x);
	modify(x,y);
}
void Solve(){
	scanf("%d%d%d",&n,&l,&q);
	for(int i=1;i<=l;i++) Q[i].clear();
	for(int i=1;i<=n;i++) S1[i].clear(),S2[i].clear(),Me(f[i],0),f[i][i]=1;
	for(int i=1;i<=l;i++){
		Me(g,0);Me(B,-1);
		for(int j=1;j<=n;j++) A[j]=read(),g[A[j]]++;
		int cnt=0;
		for(int j=1;j<=n;j++) if(!g[j]) cnt++;
		int tot=0;
		for(int j=1;j<=n;j++) tot^=A[j]^j;
		for(int j=1;j<=n;j++){
			g[A[j]]--;
			if(!g[A[j]]) cnt++;
			if(cnt==1) B[j]=(tot^A[j]);
			if(!g[A[j]]) cnt--;
			g[A[j]]++;
		}
		cnt=count(B+1,B+n+1,-1);
		if(cnt==n) op[i]=0;
		else if(cnt==n-2){
			op[i]=1;X[i]=Y[i]=0;
			for(int j=1;j<=n;j++) if(~B[j]) (X[i]?Y[i]:X[i])=j,Z[i]=B[j];
		}else{
			op[i]=2;
			copy(B+1,B+n+1,p[i]+1);
		}
	}
	for(int i=1;i<=q;i++){
		int x=read(),y=read(),z=read();
		if(!z) ans[i]=(x==y);
		else Q[z].emplace_back(x,y,i);
	}
	for(int i=1;i<=l;i++){
		if(op[i]==2){
			for(int j=1;j<=n;j++) con(j,p[i][j]),con(p[i][j],j);
		}else if(op[i]==1) con(X[i],Z[i]),con(Y[i],Z[i]);
		for(auto &[x,y,z]:Q[i]) ans[z]=f[x][y];
	}
	for(int i=1;i<=q;i++) printf("%d",ans[i]);
	printf("\n");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}