#include<bits/stdc++.h>
using namespace std;
constexpr int M=2005;bool vis[M];
int n,m,q,p[M][M],siz[M],cnt[M],ans[M];
vector<int>vec[M];bitset<M>bit[M],edge[M];
vector<tuple<int,int,int>>qry[M];
struct info{ int x,d;
	bool operator <(const info &a) const
		{return a.d<d;}
};
void link(int x,int y){
	// cerr<<x<<"->"<<y<<"!"<<endl;
	for (int i=1;i<=n;i++)
		if (bit[i][x]&&!bit[i][y])
			bit[i]|=bit[y];
}
void solve(){
	cin>>n>>m>>q;
	for (int i=1;i<=m;i++){
		string str;cin>>str;
		for (int j=1;j<=n;j++)
			p[i][j]=(str[j*2-2]-'0')*50+str[j*2-1]-'0';
	}
	for (int i=1;i<=q;i++){
		string str;cin>>str;
		int a=(str[0]-'0')*50+str[1]-'0';
		int b=(str[2]-'0')*50+str[3]-'0';
		int c=(str[4]-'0')*50+str[5]-'0';
		if (a==b) {ans[i]=1;continue;}ans[i]=0;
		if (i) qry[c].emplace_back(a,b,i);
	}
	for (int i=1;i<=n;i++) edge[i].reset();
	for (int i=1;i<=n;i++) bit[i].reset(),bit[i][i]=1;
	for (int i=1;i<=m;i++){
		for (int j=1;j<=n;j++) vec[j].clear();
		int cnt=0,pos=0;
		for (int j=1;j<=n;j++) vec[p[i][j]].emplace_back(j);
		for (int j=1;j<=n;j++)
			if (vec[j].size()>1)
				cnt+=vec[j].size()-1,pos=j;
		if (cnt>1) goto jumping;
		if (!cnt){
			for (int j=1;j<=n;j++) link(j,p[i][j]);
			goto jumping;
		}
		{
			int p=0;
			for (int i=1;i<=n;i++)
				if (vec[i].empty()){
					p=i;break;
				}
			link(vec[pos][0],p);link(vec[pos][1],p);
		}
		jumping:
		for (auto [a,b,id]:qry[i])
			ans[id]=bit[a][b];
	}
	for (int i=1;i<=q;i++) putchar(ans[i]+'0');puts("");
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T;cin>>T;while (T--) solve();return 0;
}