#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define Rep(i,a,b) for(int i=a;i>=(b);i--)
#define pb push_back
#define mid(l,r) (l+(r-l)/2)
#define MID(l,r) (l+(r-l+1)/2)
#define MEM(a,x) memset(a,x,sizeof(a))
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define lson(k) (k<<1)
#define rson(k) (k<<1|1)
#define lowbit(x) ((x)&-(x))
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef __int128_t i128;
const int mod=1e9+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int qpow(int a,int b,int P=mod){int res=1;a%=P;assert(b>=0);for(;b;b>>=1){if(b&1)res=1ll*res*a%P;a=1ll*a*a%P;}return res;}
// Think twice,code once
const int N=2005,Q=1e6+5;
int fa[N];vi 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].pb(v);
    fa[x]=y;
}

int ck,tot;
int scc[N],pre[N],low[N];
vector<int>adj[N];
stack<int>st;
void dfs(int u){
    pre[u]=low[u]=++ck;
    st.push(u);
    for(int v:adj[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]){
        ++tot;
        while(1){
            int x=st.top();st.pop();
            scc[x]=tot;
            if(x==u)break;
        }
    }
}
int deg[N],fa1[N],topo[N];vi adj1[N];
void tarjan(int n){
    ck=tot=0;
    MEM(scc,0),MEM(pre,0);
    rep(i,1,n+1)if(i==find(i)){
        adj[i].clear();
        for(auto j:e[i]){
            j=find(j);
            adj[i].pb(j);
        }
    }
    rep(i,1,n+1)if(i==find(i)){
        if(!pre[i])dfs(i);
    }
    rep(i,1,tot+1){
        deg[i]=topo[i]=0;
        fa1[i]=i,adj1[i].clear();
    }
    rep(i,1,n+1)if(i==find(i)){
        for(auto j:adj[i]){
            fa1[find(scc[i],fa1)]=find(scc[j],fa1);
            adj1[scc[i]].pb(scc[j]);
            deg[scc[j]]++;
        }
    }
    queue<int>q;
    rep(i,1,tot+1)if(!deg[i])q.push(i);
    while(!q.empty()){
        int u=q.front();q.pop();
        for(auto v:adj1[u]){
            topo[v]=max(topo[v],topo[u]+1);
            if(!--deg[v])q.push(v);
        }
    }
}

int p[N],cnt[N];
bool spj[N],vis[N],ans[Q];
vector<pii>edges[N];
vector<array<int,3>>qry[N];
void solve(){
    int n,l,q;cin>>n>>l>>q;
    rep(i,1,l+1){
        string s;cin>>s;
        int cnt1=0;
        bool flag=1;
        rep(j,1,n+1)cnt[j]=0;
        rep(j,1,n+1){
            p[j]=1*(s[j*2-2]-48)*50+(s[j*2-1]-48);
            assert(p[j]<=n);
            cnt[p[j]]++;
            if(cnt[p[j]]>1){
                if(cnt1++){
                    flag=0;break;
                }
            }
            if(cnt[p[j]]>2){
                flag=0;break;
            }
        }
        spj[i]=0,edges[i].clear(),qry[i].clear();
        if(!flag)continue;
        if(!cnt1){
            spj[i]=1;
            rep(j,1,n+1)edges[i].pb({j,p[j]});
        }else{
            rep(j,1,n+1)vis[j]=0;
            int u=-1,v=-1;
            rep(j,1,n+1){
                if(vis[p[j]])u=p[j];
                vis[p[j]]=1;
            }
            rep(j,1,n+1)if(!vis[j])v=j;
            rep(j,1,n+1)if(p[j]==u){
                edges[i].pb({j,v});
            }
        }
    }
    rep(i,1,q+1){
        array<int,3>cur;
        string s;cin>>s;
        rep(j,0,3){
            cur[j]=1*(s[j*2]-48)*50+(s[j*2+1]-48);
        }
        auto&[a,b,c]=cur;
        if(!c)ans[i]=(a==b);
        else qry[c].pb({a,b,i});
    }
    rep(i,1,n+1){
        fa[i]=i,e[i].clear();
    }
    rep(i,1,l+1){
        if(spj[i]){
            for(auto[u,v]:edges[i]){
                merge(u,v);
            }
        }else{
            for(auto[u,v]:edges[i]){
                e[find(u)].pb(v);
            }
        }
        tarjan(n);
        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]);
        }
    }
    rep(i,1,q+1)cout<<ans[i];cout<<endl;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}