#include<bits/stdc++.h>
using namespace std;
constexpr int M=2005;
int n,m,q,p[M],dis[M][M];
vector<int>vec[M];bool vis[M];
vector<pair<int,int>>adj[M];
struct info{ int x,d;
	bool operator <(const info &a) const
		{return a.d<d;}
};
void solve(){
	cin>>n>>m>>q;
	for (int i=1;i<=n;i++) adj[i].clear();
	for (int i=1;i<=m;i++){
		string str;cin>>str;
		for (int j=1;j<=n;j++)
			p[j]=(str[j*2-2]-'0')*50+str[j*2-1]-'0';
		for (int j=1;j<=n;j++) vec[j].clear();
		int cnt=0,pos=0;
		for (int j=1;j<=n;j++) vec[p[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) continue;
		if (!cnt){
			for (int j=1;j<=n;j++)
				adj[j].emplace_back(p[j],i);
			continue;
		} int p=0;
		for (int i=1;i<=n;i++)
			if (vec[i].empty()){
				p=i;break;
			}
		int x=vec[pos][0],y=vec[pos][1];
		adj[x].emplace_back(p,i);
		adj[y].emplace_back(p,i);
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++) dis[i][j]=INT_MAX,vis[j]=0;
		priority_queue<info>q;q.push({i,0});dis[i][i]=0;
		while (!q.empty()){
			auto [x,d]=q.top();q.pop();
			if (vis[x]) continue; vis[x]=1;
			for (auto [y,z]:adj[x])
				if (max(dis[i][x],z)<=dis[i][y])
					q.push({y,dis[i][y]=max(dis[i][x],z)});
		}
	}
	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';
		putchar(dis[a][b]<=c?'1':'0');
	} puts("");
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T;cin>>T;while (T--) solve();return 0;
}