#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
const int maxn=2005;
int tt[maxn],s[maxn];
bitset<maxn> flag;
class A
{
public:
	int to,val;
};
vector<A> G[maxn];
class B
{
public:
	int num,dis;
	bool operator<(const B&that)const
	{
		return dis>that.dis;
	}
};
int dis[maxn][maxn];
int input()
{
	int ans=0;
	int a='\n',b='\n';
	while(a=='\n')
		a=getchar();
	while(b=='\n')
		b=getchar();
	return 50*(a-48)+b-48;
}
int find(int d)
{
	if(s[d]!=d)
		s[d]=find(s[d]);
	return s[d];
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t,n,l,q,u,v,a,b,c;
	scanf("%d",&t);
	while (t--)
	{
		scanf("%d %d %d\n",&n,&l,&q);
		for(int i=1;i<=n;i++)
		{
			s[i]=i;
			G[i].clear();
		}
		for(int i=1;i<=l;i++)
		{
			flag.reset();
			for(int j=1;j<=n;j++)
			{
				tt[j]=input();
				flag[tt[j]]=1;
			}
			int cnt=flag.count();
			if(cnt==n)
			{
				for(int j=1;j<=n;j++)
				{
					u=find(j);
					v=find(tt[j]);
					if(u!=v)
					{
						s[u]=v;
						G[j].push_back({tt[j],i});
						G[tt[j]].push_back({j,i});
					}
				}
			}
			else if(cnt==n-1)
			{
				gp_hash_table<int,int> mp;
				flag.flip();
				v=flag._Find_next(0);
				for(int j=1;j<=n;j++)
				{
					if(mp.find(tt[j])==mp.end())
						mp[tt[j]]=j;
					else
					{
						G[mp[tt[j]]].push_back({v,i});
						G[j].push_back({v,i});
						break;
					}
				}
			}
		}
		for(int i=1;i<=n;i++)
		{
			std::priority_queue<B> q;
			q.push({i,0});
			for(int j=1;j<=n;j++)
			{
				if(j!=i)
					dis[i][j]=2147483647;
				else
					dis[i][j]=0;
			}
			while(!q.empty())
			{
				B now=q.top();
				q.pop();
				if(dis[i][now.num]!=now.dis)
					continue;
				for(auto j:G[now.num])
				{
					if(dis[i][j.to]>j.val)
					{
						dis[i][j.to]=j.val;
						q.push({j.to,j.val});
					}
				}
			}
		}
		while (q--)
		{
			a=input();
			b=input();
			c=input();
			if(dis[a][b]<=c)
				putchar('1');
			else
				putchar('0');
		}
		putchar('\n');
	}
}