#include<bits/stdc++.h>
#define N 2005
#define M 1000005
using namespace std;
int T,n,l,q,t[N][N],f[N],cnt;
int pre[N];
int ans[M];
pair<int,int>e[N];
struct z{
    int a,b,c,id;
}p[M];
bool cam(z d,z e){
    return d.c<e.c;
}
inline int find(int x){
    if(x==f[x])return x;
    return f[x]=find(f[x]);
}
vector<int>c[N];
int dfn[N],low[N],dn,vis[N],stk[N],top,belong[N],scc;
void tarjan(int u){
    dfn[u]=low[u]=++dn,vis[u]=true;stk[++top]=u;
    for(int v:c[u]){
        if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
        else if(vis[v])low[u]=min(low[u],dfn[v]);
    }
    if(dfn[u]==low[u]){
        ++scc;
        for(int y=0;y!=u;){
            y=stk[top--];
            belong[y]=scc;
            vis[y]=0;
        }
    }
}
vector<int>d[N];
bitset<2005>to[N];
int in[N];
void init(){
    for(int i=1;i<=n;i++)c[i].clear(),dfn[i]=low[i]=0,vis[i]=0;
    dn=top=scc=0;
    for(int i=1;i<=cnt;i++){
        auto [x,y]=e[i];
        int fx=find(x),fy=find(y);
        if(fx!=fy)c[fx].push_back(fy);
    }
    for(int i=1;i<=n;i++)if(f[i]==i)if(!dfn[i])tarjan(i);
    for(int i=1;i<=n;i++)d[i].clear();
    for(int i=1;i<=cnt;i++){
        auto [x,y]=e[i];
        int fx=find(x),fy=find(y);
        if(belong[fx]!=belong[fy])d[belong[fx]].push_back(belong[fy]),in[belong[fy]]++;
    }
    queue<int>q;
    for(int i=1;i<=scc;i++)if(!in[i])q.push(i),to[i].reset();
    while(!q.empty()){
        int x=q.front();
        q.pop();
        to[x][x]=1;
        for(auto y:d[x]){
            to[y]|=to[x];
            in[y]--;
            if(!in[y])q.push(y);
        }
    }
}
void add(int k){
//    if(k==1)for(int i=1;i<=n;i++)cout<<find(i)<<" "<<"!!";
    for(int i=1;i<=n;i++)pre[i]=0;
    int a=0,b=0;
    for(int i=1;i<=n;i++){
        int x=t[k][i];
//        if(k==1)for(int i=1;i<=n;i++)cout<<x<<"!!";
        if(pre[x]==0)pre[x]=i;
        else if(pre[x]!=-1){
            if(!a)a=pre[x],b=i;
            else return;
            pre[x]=-1;
        }else return ;
    }
    if(a){
        if(pre[a])e[++cnt]=(pair<int,int>){b,a};
        else e[++cnt]=(pair<int,int>){a,b};
    }else{
        for(int i=1;i<=n;i++){
            int fx=find(pre[i]),fy=find(i);
            if(fx!=fy)f[fx]=fy;
        }
    }
    for(int i=1;i<=n;i++)c[i].clear(),dfn[i]=low[i]=0,vis[i]=0;
    dn=top=scc=0;
    for(int i=1;i<=cnt;i++){
        auto [x,y]=e[i];
        int fx=find(x),fy=find(y);
        if(fx!=fy)c[fx].push_back(fy);
    }
    for(int i=1;i<=n;i++)if(f[i]==i)
        if(!dfn[i])tarjan(i);
    for(int i=1;i<=n;i++)d[i].clear();
    for(int i=1;i<=cnt;i++){
        auto [x,y]=e[i];
        int fx=find(x),fy=find(y);
        if(belong[fx]!=belong[fy])d[belong[fx]].push_back(belong[fy]),in[belong[fy]]++;
    }
    queue<int>q;
    for(int i=1;i<=scc;i++)if(!in[i])q.push(i),to[i].reset();
    while(!q.empty()){
        int x=q.front();
        q.pop();
        to[x][x]=1;
        for(auto y:d[x]){
            to[y]|=to[x];
            in[y]--;
            if(!in[y])q.push(y);
        }
    }
    return;
}
int main(){
    cin>>T;
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    while(T--){
        cin>>n>>l>>q;
        cnt=0;
        for(int i=1;i<=l;++i){
            string s;
            cin>>s;
            int len=s.size();
            for(int k=1,j=0;j<len;j+=2,k++){
                int a=s[j]-48,b=s[j+1]-48;
                int x=a*50+b;
                t[i][k]=x;
            }
        }
        for(int i=1;i<=q;++i){
            string s;
            cin>>s;
            int a=s[0]-48,b=s[1]-48;
            int x=a*50+b;
            p[i].a=x;
            a=s[2]-48,b=s[3]-48,x=a*50+b;
            p[i].b=x;
            a=s[4]-48,b=s[5]-48,x=a*50+b;
            p[i].c=x;
            p[i].id=i;
        }
        sort(p+1,p+q+1,cam);
        for(int i=1;i<=n;i++)f[i]=i;
        init();
        for(int i=1;i<=q;i++){
            for(int j=p[i-1].c+1;j<=p[i].c;j++){
                add(j);
            }
            int fx=find(p[i].a),fy=find(p[i].b);
            if(belong[fx]==belong[fy])ans[p[i].id]=1;
            else if(to[belong[fx]][belong[fy]]){
                ans[p[i].id]=1;
            }else ans[p[i].id]=0;
        }
        string s="";
        for(int i=1;i<=q;i++)s+=char(ans[i]^48);
        cout<<s<<"\n";
        
    }
}