#include<bits/stdc++.h>
#define pr pair<int,int>

using namespace std;

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

const int N=2005,M=N*2;
int n,l,q;
char s[N*2];
int t[N][N];

int head[N],to[M],nxt[M],cf[M],cnt;
void add(int u,int v)
{
	to[++cnt]=v;
	nxt[cnt]=head[u];
	cf[cnt]=u;
	head[u]=cnt;
}

int last[N];
int dfsn[N],low[N],scc[N],num,dfscnt;
bool vis[N];
int sta[N],tp;
bitset<2001>ovo[N]; 
int x[M],y[M],deg[N],summ;

void tarjan(int now)
{
	dfsn[now]=low[now]=++dfscnt;
	vis[now]=1;
	sta[++tp]=now;
	for(int i=head[now];i;i=nxt[i])
	{
		int v=to[i];
		if(!dfsn[v])
			tarjan(v),low[now]=min(low[v],low[now]);
		else if(vis[v])
			low[now]=min(low[now],low[v]);
	}
	if(dfsn[now]==low[now])
	{
		++num;
		while(tp&&sta[tp]!=now)
		{
			scc[sta[tp]]=num;
			vis[sta[tp]]=0;
			tp--;
		}
		scc[sta[tp]]=num;
		vis[now]=0;
		tp--;
	}
}

pr awa[N*2];
int tot;
int bin[N];
int anc(int x){return bin[x]==x?x:bin[x]=anc(bin[x]);}

void work()
{
	cnt=0;
	fill(head,head+n+1,0);
	for(int i=1;i<=tot;i++)
		add(anc(awa[i].first),anc(awa[i].second));
	fill(dfsn,dfsn+n+1,0);dfscnt=tp=num=0;
	fill(low,low+n+1,0);
	fill(scc,scc+n+1,0);
	fill(vis,vis+n+1,0);
	for(int i=1;i<=n;i++)
		if(!dfsn[i])
			tarjan(i);
	for(int i=1;i<=num;i++)
		ovo[i].reset(),ovo[i][i]=1;
	summ=0;
	for(int i=1;i<=cnt;i++)
		++summ,x[summ]=scc[cf[i]],y[summ]=scc[to[i]];
	cnt=0;
	fill(head,head+num+1,0);
	for(int i=1;i<=summ;i++)
		add(x[i],y[i]),deg[y[i]]++;
	queue<int>Q;
	for(int i=1;i<=num;i++)
		if(!deg[i])
			Q.push(i);
	while(!Q.empty())
	{
		int now=Q.front();Q.pop();
		for(int i=head[now];i;i=nxt[i])
		{
			int v=to[i];
			ovo[v]|=ovo[now];
			deg[v]--;
			if(!deg[v])
				Q.push(v);
		}
	}
}

int a[1000005],b[1000005],c[1000005],p[1000005];
char ans[1000005];
vector<int>qwq[N];

int dfs(int x)
{
	if((int)qwq[x].size()>=1)
		return dfs(qwq[x][0]);
	return x;
}

void solve()
{
	n=read(),l=read(),q=read();tot=0;
	for(int i=1;i<=n;i++)
		bin[i]=i;
	for(int i=1;i<=l;i++)
	{
		scanf("%s",s+1);
		for(int j=1;j<=n;j++)
			t[i][j]=(s[2*j-1]-48)*50+(s[2*j]-48);
	}
	for(int i=1;i<=q;i++)
	{
		scanf("%s",s+1);
		a[i]=(s[1]-48)*50+s[2]-48;
		b[i]=(s[3]-48)*50+s[4]-48;
		c[i]=(s[5]-48)*50+s[6]-48;
		p[i]=i;
	}
	sort(p+1,p+q+1,[&](int x,int y){return c[x]<c[y];});
	int now=0;
	for(int i=1;i<=q;i++)
	{
		while(now+1<=c[p[i]])
		{
			now++;
			int x=0,y=0;
			bool ok=1;
			fill(last,last+n+1,0);
			for(int j=1;j<=n;j++)
			{
				if(!last[t[now][j]])
					last[t[now][j]]=j;
				else
				{
					if(x&&y)
					{
						ok=0;
						break;
					}
					x=last[t[now][j]],y=j;
				}
			}
			if(!ok)
				continue;
			if(!x&&!y)
			{
				fill(vis,vis+n+1,0);
				for(int j=1;j<=n;j++)
				{
					while(!vis[j])
					{
						vis[j]=1;
						bin[anc(j)]=anc(t[now][j]);
						j=t[now][j];
					}
				}
			}
			else
			{
				fill(last,last+n+1,0);
				for(int j=1;j<=n;j++)
					qwq[j].clear();
				for(int j=1;j<=n;j++)
				{
					if(j==x||j==y)
						continue;
					last[t[now][j]]=j;
					qwq[t[now][j]].push_back(j);
				}
				qwq[t[now][x]].push_back(x);
				int cur=dfs(y);
				if(cur!=y)
					awa[++tot]=make_pair(y,cur);
				qwq[t[now][x]].pop_back();
				qwq[t[now][y]].push_back(y);
				cur=dfs(x);
				if(cur!=x)
					awa[++tot]=make_pair(x,cur); 
			}
		}
		if(i==1||c[p[i]]!=c[p[i-1]])
			work();
		ans[p[i]]=ovo[scc[anc(b[p[i]])]][scc[anc(a[p[i]])]]+'0';
	}
	for(int i=1;i<=q;i++)
		putchar(ans[i]);
	puts("");
}

signed main()
{
	int Tests=read();
	while(Tests--)
		solve();
	return 0;
}