#include <bits/stdc++.h>
#define ll int
#define LL long long
#define ls p<<1
#define rs p<<1|1
#define Ma 1000005
#define mod 1000000007
#define PLL pair<ll,ll>
#define PDD pair<double,double>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fi first
#define se second
#define N 2005
#define pb push_back
#define ld long double
#define all(x) x.begin(),x.end()
#define inf 1e18

using namespace std;
ll n,m,q;


ll a[N][N];


ll ask(ll x,ll y)
{
	return (x-48)*50+(y-48);
}


struct node{
	ll a,b,c,id;
	bool operator <(const node &A)const{
		return c<A.c;
	}
}t[Ma];
ll ans[Ma];


ll ru[N];
ll vis[N];
ll fa[N];
bitset <N> f[N];

ll find(ll x)
{
	if (fa[x]==x) return fa[x];
	return fa[x]=find(fa[x]);
}

void merage(ll x,ll y)
{
	x=find(x),y=find(y);
	if (x==y)
		return ;
	f[x]|=f[y];
	fa[y]=x;
}


void dfs(ll id,ll x)
{
	vis[x]=1;
	while (!vis[a[id][x]])
		merage(x,a[id][x]),x=a[id][x],vis[x]=1;
	return;
}

void go(ll x)
{
	for (ll i=1;i<=n;i++)
		ru[i]=0;
	ll cnt=0;
	for (ll i=1;i<=n;i++)
	{
		ru[a[x][i]]++;
		if (ru[a[x][i]]==2)
			cnt++;
		if (ru[a[x][i]]>2)
			return;
	}
	if (cnt>=2)
		return;
	ll z=0;
	for (ll i=1;i<=n;i++)
		if (!ru[i])
			z=i; 
	if (cnt)
	{
		for (ll i=1;i<=n;i++)
		{
			if (ru[a[x][i]]==2)
				f[find(i)]|=f[find(z)];
		}
		return;
	}
	for (ll i=1;i<=n;i++)
		vis[i]=0;
	for (ll i=1;i<=n;i++)
		if (!vis[i])
			dfs(x,i);
	return;
}


void sol()
{
	cin>>n>>m>>q;
	for (ll i=1;i<=n;i++)
		for (ll j=0;j<N;j++)
			f[i][j]=(i==j);
	for (ll i=1;i<=n;i++)
		fa[i]=i;
	for (ll i=1;i<=m;i++)
	{
		string s;
		cin>>s;
		for (ll j=1;j<=n;j++)
			a[i][j]=ask(s[j*2-2],s[j*2-1]);
	}
	/*printf("A=\n");
	for (ll i=1;i<=m;i++)
	{
		for (ll j=1;j<=n;j++)
			printf("%d ",a[i][j]);
		printf("\n");
	}*/

	for (ll i=1;i<=q;i++)
	{
		string s;
		cin>>s;
		ll x=ask(s[0],s[1]),y=ask(s[2],s[3]),z=ask(s[4],s[5]);
		t[i]={x,y,z,i};
		
	}	
	/*printf("T=\n");
	for (ll i=1;i<=q;i++)
		printf("%d %d %d %d\n",t[i].a,t[i].b,t[i].c,t[i].id);*/
	sort(t+1,t+q+1);
	ll x=0;
	for (ll i=1;i<=q;i++)
	{
		while (x<t[i].c) go(++x);
		if (f[find(t[i].a)][t[i].b]) ans[t[i].id]=1;
		else ans[t[i].id]=0;
	}
	for (ll i=1;i<=q;i++)
		printf("%d",ans[i]);
	printf("\n");
	return;
}

int main()
{
	IOS
	ll tt=1;
	cin>>tt;
	while (tt--)
		sol();
	return 0;
}
/*
1
4 2 1
02010403
01040402
010402
*/