#include<bits/stdc++.h>

using namespace std;

const int N=2005;

int n,m,q;

int fa[N];

int t[N][N];
bool vis[N][N];


bool ans[1000005];

struct ss{

	int a,b,c,id;

	bool operator <(const ss ot)const{

		return c<ot.c;

	}

}Q[1000005];


vector<int> g[2005],G[2005];

int find(int x)

{

	if(x==fa[x])return x;

	return fa[x]=find(fa[x]);

}

bool merge(int x,int y)

{

	x=find(x);y=find(y);

	if(x==y)return 1;

	fa[x]=y;

	return 0;

}

vector<int> e[N];
set<int> s;
void upd(int *t)

{

	for(int i=1;i<=n;i++)

		e[i].clear();

	for(int i=1;i<=n;i++)

	{

		e[t[i]].push_back(i);

	}

	int mx=0,sum=0,mi=0;

	for(int i=1;i<=n;i++)

	{

		if(e[i].size())

		{

			sum++;

			if(e[i].size()>1)

				mx=i;

		}

		else mi=i;

	}

	if(sum==n-1)

	{

		G[mi].push_back(e[mx][0]);

		G[mi].push_back(e[mx][1]);

	}

	else if(!mx)

	{

		for(int i=1;i<=n;i++)

			merge(i,t[i]);

	}

	for(int i=1;i<=n;i++)

		g[i].clear();

	for(int i=1;i<=n;i++)

	{

		int x=find(i);

		for(auto j:G[i])

		{

			int y=find(j);

			//cerr<<x<<" "<<y<<endl;

			if(x!=y)g[x].push_back(y);

		}

	}

}

bool bfs(int s,int t,bool *vis)

{

	for(int i=1;i<=n;i++)

		vis[i]=0;

	s=find(s);t=find(t);

	queue<int> q;

	q.push(s);

	vis[s]=1;

	while(!q.empty())

	{

		int x=q.front();q.pop();

		for(auto y:g[x])

		{

			if(!vis[y])

			{

				q.push(y);

				vis[y]=1;

			}

		}

	}
    
	return vis[t];

}

void sol()

{

	cin>>n>>m>>q;
    for(int i=1;i<=q;i++)
        ans[i]=0;

	for(int i=1;i<=n;i++)fa[i]=i,G[i].clear(),g[i].clear();
	for(int i=1;i<=m;i++)

	{

		char a,b;

		for(int j=1;j<=n;j++)

		{

			cin>>a>>b;

			int x=(a-'0')*50+b-'0';

			t[i][j]=x;

		}

	}

	for(int i=1;i<=q;i++)

	{

		char a,b;

		cin>>a>>b;

		Q[i].a=(a-'0')*50+b-'0';

		//cerr<<Q[i].a<<endl;

		cin>>a>>b;

		Q[i].b=(a-'0')*50+b-'0';

		cin>>a>>b;

		Q[i].c=(a-'0')*50+b-'0';

		Q[i].id=i;

	}

	sort(Q+1,Q+q+1);

	int now=1;
    s.clear();
	for(int i=1;i<=q;i++)

	{

		while(now<=Q[i].c)

		{

		//	cerr<<now<<endl;

			upd(t[now]);

			now++;

            s.clear();

		}
        if(s.count(find(Q[i].b)))
        {
		    ans[Q[i].id]=vis[find(Q[i].b)][Q[i].id];
        }
        else
        {
            s.insert(find(Q[i].b));
		    ans[Q[i].id]=bfs(Q[i].b,Q[i].a,vis[find(Q[i].b)]);
        }
	}

	for(int i=1;i<=q;i++)

		cout<<ans[i];

	cout<<'\n';

}

int main(){

	ios::sync_with_stdio(0);

	cin.tie(0);cout.tie(0);

//	char a,b;

//	for(char c=48;c<=98;c++)

//		cerr<<c<<endl;

//	cin>>a>>b;

	int t;

	for(cin>>t;t;t--){

		sol();

	}

	return 0;

}