#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
char s[N];
int a[2005][2005];
const int Q=1e6+10;
struct node{
	int a,b,c,id,ans;
}query[Q];
bool cmp1(node a,node b){
	return a.c<b.c;
}
bool cmp2(node a,node b){
	return a.id<b.id;
}
int fa[2010];
int getpa(int x){
	if(x==fa[x])return x;
	return fa[x]=getpa(fa[x]);
}
int deg[2010];
vector<int>G[2010];

int tmpfa[2010];
int tmpgetpa(int x){
	if(x==tmpfa[x])return x;
	return tmpfa[x]=tmpgetpa(tmpfa[x]);
}


inline void merg(int aa,int bb){
	int fa1=getpa(aa),fa2=getpa(bb);
	if(fa1==fa2)return;
	//printf("%d %d\n",fa1,fa2);
	fa[fa1]=fa2;
	for(auto x:G[fa1]){
		G[fa2].push_back(x);
	}
}

bool vis[2010];
int n;
queue<int>que;
bool bfs(int st,int ed){
	if(st==ed)return 1;
	//printf("%d %d\n",st,ed);
	while(!que.empty())que.pop();
	for(int i=1;i<=n;++i)vis[i]=0;
	vis[st]=1;que.push(st);
	while(!que.empty()){
		int u=que.front();que.pop();//printf("%d\n",u);
		for(auto v:G[u]){
			int fv=getpa(v);
			if(vis[fv])continue;
			vis[fv]=1;que.push(fv);
			if(fv==ed)return 1;
		}
	}
	return 0;
}

int ff0[2010];

void solve(){
	int l,q;scanf("%d%d%d",&n,&l,&q);
	for(int i=1;i<=n;++i)fa[i]=i,G[i].clear();
	for(int i=1;i<=l;++i){
		scanf("%s",s+1);
		for(int j=1;j<=n;++j){
			a[i][j]=50*(s[j*2-1]-48)+(s[j*2]-48);
		}
	}
	for(int i=1;i<=q;++i){
		scanf("%s",s+1);
		query[i].a=50*(s[1]-48)+s[2]-48;
		query[i].b=50*(s[3]-48)+s[4]-48;
		query[i].c=50*(s[5]-48)+s[6]-48;
		//printf("%d %d %d\n",query[i].a,query[i].b,query[i].c);
		query[i].id=i;
		query[i].ans=0;
	}
	sort(query+1,query+q+1,cmp1);
	for(int i=1,top=0;i<=q;++i){
		while(top<l&&top<query[i].c){
			++top;
			for(int j=1;j<=n;++j){
				tmpfa[j]=j;deg[j]=0;
			}
			for(int j=1;j<=n;++j){
				deg[a[top][j]]++;
				int fa1=tmpgetpa(j),fa2=tmpgetpa(a[top][j]);
				tmpfa[fa1]=fa2;
			}
			//for(int j=1;j<=n;++j)printf("%d ",deg[j]);
			//puts("");
			int flg=0;
			for(int j=1;j<=n;++j){
				if(deg[j]>=3){
					flg=1;break;
				}else if(deg[j]==2){
					//if(a[top][a[top][j]]==j)continue;
					flg=2;break;
				}
			}
			if(flg==1)continue;
			if(flg==0){
				for(int j=1;j<=n;++j){
					merg(j,a[top][j]);
				}
				//cerr<<"?";
			}else{
				int ss2=0;
				for(int j=1;j<=n;++j)ff0[j]=0;
				for(int j=1;j<=n;++j){
					if(deg[j]==2){
						ss2++;
					}
					if(deg[j]==0){
						ff0[tmpgetpa(j)]=j;
					}
				}
				if(ss2>=2){
					continue;
				}
				for(int j=1;j<=n;++j){
					if(deg[a[top][j]]==2){
						if(ff0[tmpgetpa(j)]!=0)G[getpa(j)].push_back(ff0[tmpgetpa(j)]);
						//printf("%d %d\n",getpa(j),ff0[tmpgetpa(j)]);
					}
				}
			}
		}
		//for(int j=1;j<=n;++j)printf("%d ",fa[j]);
		//puts("");
		int fa1=getpa(query[i].a),fa2=getpa(query[i].b);
		//printf("%d %d\n",fa1,fa2);
		query[i].ans=bfs(fa1,fa2);
	}
	sort(query+1,query+q+1,cmp2);
	for(int i=1;i<=q;++i)printf("%d",query[i].ans);
	puts("");
}
int main()
{
	int T;scanf("%d",&T);
	while(T--){
		solve();
	}
	return 0;
}