#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;
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 n,l,q;
int mp[2005][2005];
int E[4005][2],cnt,fa[2005];
int ans[1000005];
struct sss{
    int a,b,c,num;
}que[1000005];
int get_fa(int x){
    return fa[x]==x?x:fa[x]=get_fa(fa[x]);
}
void link(int a,int b){
    a=get_fa(a);b=get_fa(b);
    fa[a]=b;
}
int sum[2005];
void add(int o){
    memset(sum,0,sizeof sum);
    int flag=0;
    for(int i=1;i<=n;i++){
        sum[mp[o][i]]++;
        if(sum[mp[o][i]]>1){
            if(flag)return;
            flag=mp[o][i];
        }
    }
    if(!flag){
        for(int i=1;i<=n;i++)link(i,mp[o][i]);
    }
    else{
        int a=0,b=0;
        for(int i=1;i<=n;i++)
            if(mp[o][i]==flag){
                if(a==0)a=i;
                else b=i;
            }
        int r=0;
        for(int i=1;i<=n;i++)
        	if(sum[i]==0)r=i;
        if(r!=a){
        	++cnt;
        	E[cnt][0]=a;E[cnt][1]=r;
		}
		if(r!=b){
        	++cnt;
        	E[cnt][0]=b;E[cnt][1]=r;
		}
    }
}
vector <int> to[2005];
int vis[2005];
void DFS(int x){
    vis[x]=1;
    for(int i:to[x])
        if(!vis[i])DFS(i);
}
void solve() {
    cnt=0;
    n=read();l=read();q=read();
    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 x,sss y){return x.c<y.c;});
    int now=0;
    for(int i=1;i<=q;i++){
        while(now!=que[i].c){
            now++;
            add(now);
        }
        // memset(to,0,sizeof to);
        for(int j=1;j<=n;j++)to[j] = vector<int>();
        for(int j=1;j<=cnt;j++)
            to[get_fa(E[j][0])].push_back(get_fa(E[j][1]));
        memset(vis,0,sizeof vis);
        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';
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T=read();
    while (T--) solve();
    return 0;
}