#include<iostream>
#include<cstdio>
#include<vector>
#define N 2000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int get()
{
	char a=0,b;
	while (a<'0'||a>'a') a=getchar();
    b=getchar();
	return (a-48)*50+b-48;
}
int T,n,l,q,st,t[N+1],cnt[N+1],rt[N+1],dis[N+1][N+1];
vector<int>E[N+1];
int find(int x)
{
	if (rt[x]==x) return x;
	return rt[x]=find(rt[x]);
}
void unionn(int x,int y)
{
	rt[x]=y;
	return;
}
void solve(int x,int y)
{
	dis[x][y]=st;
	for (int i=0;i<E[y].size();++i)
		if (dis[x][E[y][i]]==inf)
			solve(x,E[y][i]);
	return;
}
void add(int x,int y)
{
	E[x].push_back(y);
	for (int i=1;i<=n;++i)
		if (dis[i][x]!=inf&&dis[i][y]==inf)
			solve(i,y);
	return;
}
int main()
{
	int a,b,c,srt,res;
	T=read();
	while (T--)
	{
		n=read(),l=read(),q=read();
		for (int i=1;i<=n;++i)
			for (int j=1;j<=n;++j)
				dis[i][j]=(i==j)?0:inf;
		for (int i=1;i<=n;++i) rt[i]=i;
		for (int i=1;i<=l;++i)
		{
			st=i;
			for (int j=1;j<=n;++j) cnt[j]=0;
			for (int j=1;j<=n;++j) t[j]=get(),cnt[t[j]]++;
			res=0;
			for (int j=1;j<=n;++j) res+=max(cnt[j]-1,0);
			if (!res)
			{
				for (int j=1;j<=n;++j)
					if (find(j)!=find(t[j]))
						add(j,t[j]),add(t[j],j);
			}
			else if (res==1)
			{
				srt=0;
				for (int j=1;j<=n;++j)
					if (!cnt[j])
						srt=j;
				for (int j=1;j<=n;++j)
					if (cnt[t[j]]==2)
						add(j,srt);
			}
		}
		while (q--) a=get(),b=get(),c=get(),printf("%d",c>=dis[a][b]);
		puts("");
	}
	return 0;
}