#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int inf=0x3f3f3f3f;
const int N=2e3+10;
int n,l,Q,cnt[N],dis[N][N];
int fa[N];
int b[N],flag[N];
vector<pair<int,int> > t[N];
string s;
bool p[N];
struct node
{
	int x,dis;
	friend bool operator <(node a,node b)
	{
		return a.dis>b.dis;
	}
};
priority_queue<node> q;
void dijkstra(int st)
{
	for(int i=1;i<=n;++i) dis[st][i]=inf,p[i]=0;
	dis[st][st]=0;
	q.push({st,0});
	while(!q.empty())
	{
		node u=q.top();
		q.pop();
		int x=u.x;
		if(p[x]) continue;
		p[x]=1;
		for(auto &[y,z]:t[x])
		{
			int maxn=max(dis[st][x],z);
			if(dis[st][y]>maxn)
			{
				dis[st][y]=maxn;
				q.push({y,dis[st][y]});
			}
		}
	}
}
int find(int x)
{
	if(fa[x]==x) return x;
	return fa[x]=find(fa[x]);
}
void work()
{
    cin>>n>>l>>Q;
    for(int i=1;i<=n;++i) fa[i]=i,t[i].clear();
    for(int i=1;i<=l;++i)
    {
    	flag[i]=0;
    	cin>>s;
    	for(int j=1;j<=n;++j) cnt[j]=0;
    	int shu=0;
    	for(int j=1;j<=n;++j)
    	{
    		b[j]=50*(s[2*j-2]-'0')+s[2*j-1]-'0';
    		if(cnt[b[j]])
    		{
    			++shu;
    			if(shu>=2) flag[i]=2; 
				else flag[i]=1; 
			}
			cnt[b[j]]++;
		}
		if(flag[i]==2) continue;
		if(flag[i]==0)
		{
			for(int j=1;j<=n;++j)
			{
				int fx=find(fa[j]),fy=find(fa[b[j]]);
				if(fx==fy) continue;
				fa[fx]=fy;
				t[j].push_back(make_pair(b[j],i));
				t[b[j]].push_back(make_pair(j,i));
			}
		}
		else
		{
			int zero=0;
			for(int j=1;j<=n;++j)
			{
				if(cnt[j]==0)
				{
					zero=j;
					break;
				}
			}
			for(int j=1;j<=n;++j)
			{
				if(cnt[b[j]]==2)
				  t[j].push_back(make_pair(zero,i));
			}
		}
	}
	for(int i=1;i<=n;++i)  dijkstra(i);
	for(;Q;--Q)
	{
		cin>>s;
		int a,b,c;
		a=50*(s[0]-'0')+s[1]-'0';
        b=50*(s[2]-'0')+s[3]-'0';
        c=50*(s[4]-'0')+s[5]-'0';
        //cout<<dis[a][b]<<endl;
        cout<<(dis[a][b]<=c);
	}
	cout<<endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T=1;
    cin>>T;
    for(;T;--T)
      work();
    return 0;
}