#include "bits/stdc++.h"
using namespace std;
const int Len = 2005 , M = 1e6 + 5;
int n,m,q;
bitset<Len> bst[Len],tsb;
int t[Len][Len],Pt[M],vis[Len];vector<int> lll;
inline int tr(char c,char d){return (c - 48) * 50 + d - 48;}
struct node
{
	int a,b,i;
	node(){a = b = i = 0;}
	node(int A,int B,int I){a = A , b = B , i = I;}
};
vector<node> qs[Len];vector<int> tmp[Len];
void dfs(int I,int j)
{
	if(vis[t[I][j]]) return;
	vis[t[I][j]] = 1 , tsb |= bst[t[I][j]] , lll.push_back(t[I][j]);
	dfs(I , t[I][j]);
}
inline void Lily(int a,int b){if(!bst[a][b]) for(int i = 1 ; i <= n ; i ++) if(bst[i][a] && !bst[i][b]) bst[i] |= bst[b];}
inline void solve()
{
	scanf("%d %d %d",&n,&m,&q);
	for(int i = 1 ; i <= m ; i ++)
	{
		string s;cin >> s;
		for(int j = 0 ; j < n ; j ++) t[i][j + 1] = tr(s[(j << 1)] , s[(j << 1 | 1)]);
		qs[i].clear();		
	}
	for(int i = 1 ; i <= n ; i ++) bst[i].reset() , bst[i].set(i);
	for(int i = 1 ; i <= q ; i ++)
	{
		string s;cin >> s;int a,b,c;
		a = tr(s[0] , s[1]) , b = tr(s[2] , s[3]);
		c = tr(s[4] , s[5]);
		if(!c) Pt[i] = (a == b);
		else qs[c].push_back(node(a , b , i));
	}
	for(int i = 1 ; i <= m ; i ++) 
	{
		for(int j = 1 ; j <= n ; j ++) tmp[j].clear();
		for(int j = 1 ; j <= n ; j ++) tmp[t[i][j]].push_back(j);
		int ct = 0 , ps = 0 , emp = 0;
		for(int j = 1 ; j <= n ; j ++) 
		{
			if((int)tmp[j].size() > 1) ct += (int)tmp[j].size() - 1 , ps = j; 
			else if(tmp[j].empty()) emp = j;
		}
		if(!ct)//circle
			for(int j = 1 ; j <= n ; j ++) Lily(j , t[i][j]);
		else if(ct == 1) Lily(tmp[ps][0] , emp) , Lily(tmp[ps][1] , emp);
		const int SZZ = (int)qs[i].size();
		for(int j = 0 ; j < SZZ ; j ++) Pt[qs[i][j].i] = (bst[qs[i][j].a][qs[i][j].b]);
	}
	for(int i = 1 ; i <= q ; i ++) putchar(Pt[i] + '0');
	puts("");
}
signed main()
{
	int T;scanf("%d",&T);
	while(T --) solve();
	return 0;
}