#include<bits/stdc++.h>
#define PII pair<int,int>
using namespace std;
const int mxn=2e3+8;
int T,n,m1,m2,tot;
int h[mxn],temp[mxn],dp[mxn],vis[mxn];
int pr[mxn],mp[mxn][mxn];
int root(int x){
  return pr[x]=(pr[x]==x?x:root(pr[x]));}

struct Star{
 int to,w,nx; 
}star[mxn*mxn];

void add(int x,int y,int w){
  star[++tot].nx=h[x];
  star[tot].to=y;
  star[tot].w=w;
  h[x]=tot;}

void dijkstra(int x){
  memset(mp[x],0x3f,sizeof mp[x]);mp[x][x]=0;
  memset(vis,0,sizeof vis);
  priority_queue<PII,vector<PII>,greater<PII>>q;
  q.push({0,x});
  while(q.size()){
    auto dfrom=q.top();q.pop();
    int dval=dfrom.first;
    int dpoint=dfrom.second;
    if(vis[dpoint])continue;
    vis[dpoint]=1;

    for(int i=h[dpoint];~i;i=star[i].nx){
      int dto=star[i].to;
      if(vis[dto])continue;
      mp[x][dto]=min(mp[x][dto],max(star[i].w,mp[x][dpoint]));
      q.push({star[i].w,dto});
    }
  }
  return ;
}

signed main(){
  ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
  cin >> T;
  while(T--){
    cin >> n >> m1 >> m2 ;
    for(int i=1;i<=n;i++)pr[i]=i,h[i]=-1;
    int from=0,to=0;tot=0;

    for(int i=1;i<=m1;i++){
      int sum = 0 ;  
      string s;cin >> s ;
      for(int j=0;j<n;j++){
        temp[j+1]=(s[j*2]-'0')*50+(s[j*2+1]-'0');
        dp[temp[j+1]]+=1;}

      for(int j=1;j<=n;j++){
      if(dp[j]==0)to=j;
      if(dp[j]==2)from=j;
      if(dp[j]){sum+=1,dp[j]=0;}}

      if(sum==n){
        for(int j=1;j<=n;j++){//建立环状边
        int k=temp[j];
        if(root(j)!=root(k))
        add(j,k,i),add(k,j,i),pr[j]=root(k);}}
      
      else if(sum==n-1)
      for(int j=1;j<=n;j++)//建立单项边
      if(temp[j]==from)add(j,to,i);
    }
    for(int i=1;i<=n;i++)dijkstra(i);

    for(int i=1;i<=m2;i++){
      string s;cin >> s ;
      int from,to,lim;
      from=(s[0]-'0')*50+(s[1]-'0');
      to=(s[2]-'0')*50+(s[3]-'0');
      lim=(s[4]-'0')*50+(s[5]-'0');
      cout << (mp[from][to]<=lim) ;
    }
    cout << '\n';
  }
  return 0;
}