#include<bits/stdc++.h>
using namespace std;

int read(){
    int f=0,s=0; char c=getchar();
    while(c>'9'||c<'0')f=(c=='-'),c=getchar();
    while(c>='0'&&c<='9')s=(s<<3)+(s<<1)+(c^'0'),c=getchar();
    return f?-s:s;
}

const int N=2005,Q=1e6+5;
int T;
int n,m,q;
char s[N*2];
int t[N][N];
#define pii pair<int,int>
vector<pii> edg[N];

int fa[N];
vector<int> e[N];
int find(int x,int *fa=fa){
    return fa[x]==x?x:fa[x]=find(fa[x],fa);
}
void merge(int x,int y){
    x=find(x),y=find(y);
    if(x==y)return;
    if(e[x].size()>e[y].size())swap(x,y);
    for(auto v:e[x]){
        e[y].push_back(v);
    }
    fa[x]=y;
}

int pre[N],low[N],scc[N],dc,sccn;
vector<int>adj[N];
stack<int>stk;
void dfs(int u){
    pre[u]=low[u]=++dc;
    stk.push(u);
    for(auto v:e[u]){
        if(!pre[v]){
            dfs(v);
            low[u]=min(low[u],low[v]);
        }
        else if(!scc[v])low[u]=min(low[u],pre[v]);
    }
    if(low[u]==pre[u]){
        sccn++;
        for(;;){
            int x=stk.top();stk.pop();
            scc[x]=sccn;
            if(x==u)break;
        }
    }
}
int deg[N],topo[N],fa1[N];
vector<int>adj1[N];
void tarjan(){
    dc=sccn=0;
    memset(scc,0,sizeof(scc));
    memset(pre,0,sizeof(pre));
    memset(low,0,sizeof(low));
    for(int i=1;i<=n;i++){
        deg[i]=topo[i]=0;
        adj[i].clear(),adj1[i].clear();
        if(i!=find(i))continue;
        for(auto j:e[i]){
            j=find(j),fa1[i]=j;
            adj[i].push_back(j);
        }
    }
    while(!stk.empty())stk.pop();
    for(int i=1;i<=n;i++)if(i==find(i)){
        if(!pre[i])dfs(i);
    }
    iota(fa1+1,fa1+sccn+1,1);
    for(int i=1;i<=n;i++)if(i==find(i)){
        int u=scc[i];
        for(auto v:adj[u]){
            v=scc[v];
            if(u!=v){
                int x=find(u,fa1);
                int y=find(v,fa1);
                fa1[x]=y;
                adj1[u].push_back(v);
                deg[v]++;
            }
        }
    }
    queue<int>q;
    for(int i=1;i<=sccn;i++)if(!deg[i]){
        q.push(i);
    }
    while(!q.empty()){
        int u=q.front();q.pop();
        for(auto v:adj1[u])if(!--deg[v]){
            topo[v]=topo[u]+1,q.push(v);
        }
    }
}

vector<array<int,3>>qry[N];
bool spj[N],ans[Q];
void work(){
    n=read(); m=read(); q=read();
    for(int i=1;i<=m;i++){
        scanf("%s",s+1);
        for(int j=1;j<=n;j++){
            int tmp=1*(s[j*2-1]-48)*50+(s[j*2]-48);
            t[i][j]=tmp;
        }
        unordered_map<int,int> tt;
        int tc=0;
        bool flag=1;
        for(int j=1;j<=n;j++){
            tt[t[i][j]]++;
            if(tt[t[i][j]]>1)tc++;
            if(tc>1){
                flag=0;
                break;
            }
            if(tt[t[i][j]]>2){
                flag=0;
                break;
            }
        }
        edg[i].clear(),qry[i].clear(),spj[i]=0;
        if(!flag)continue;
        if(tc==0){
            spj[i]=1;
            for(int j=1;j<=n;j++)edg[i].push_back({j,t[i][j]});
        }
        else{
            unordered_map<int,bool> vis;
            int id0=-1,id2=-1;
            for(int j=1;j<=n;j++){
                if(vis[t[i][j]])id2=t[i][j];
                vis[t[i][j]]=1;
            }
            for(int j=1;j<=n;j++)if(!vis[j])id0=j;
            for(int j=1;j<=n;j++)if(t[i][j]==id2){
                edg[i].push_back({j,id0});
            }
        }
    }
    for(int i=1;i<=q;i++){
        array<int,3>cur;
        scanf("%s",s+1);
        for(int j=1;j<=3;j++){
            int tmp=1*(s[j*2-1]-48)*50+(s[j*2]-48);
            cur[j-1]=tmp;
        }
        auto&[a,b,c]=cur;
        if(!c)ans[i]=(a==b);
        else qry[c].push_back({a,b,i});
    }
    iota(fa+1,fa+n+1,1);
    for(int i=1;i<=n;i++){
        e[i].clear();
    }
    for(int i=1;i<=m;i++){
        if(spj[i]){
            for(auto[u,v]:edg[i]){
                merge(u,v);
            }
        }else{
            for(auto[u,v]:edg[i]){
                u=find(u),v=find(v);
                e[u].push_back(v);
            }
        }
        // for(int u=1;u<=n;u++)cout<<find(u)<<" \n"[u==n];
        tarjan();
        for(auto[a,b,qi]:qry[i]){
            a=scc[find(a)],b=scc[find(b)];
            ans[qi]=(a==b||find(a,fa1)==find(b,fa1)&&topo[a]<topo[b]);
        }
    }
    for(int i=1;i<=q;i++)cout<<ans[i];
    cout<<endl;
}

int main(){
    T=read();
    while(T--)work();
    return 0;
}