#include<bits/stdc++.h>
#define endl '\n'
using namespace std;

//#define int long long
const int N=2e3+5,M=1e6+5;

int to[N][N],vis[N][N],op[N],v[N];
int n,m,Q;
int ans[M];
struct Query{int a,b,id;};
int f[N],d[N];
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
vector<int>G[N];
bitset<N>dp[N];
vector<Query>query[N];

int dfn[N],low[N],Tm,Stack[N],Top,vis2[N],id;
vector<int>B[N],G2[N];

void tarjan(int x){
    dfn[x]=low[x]=++Tm;
    Stack[++Top]=x;
    vis2[x]=1;
    for(auto y:G[x]){
        if(!dfn[y]){
            tarjan(y);
            low[x]=min(low[x],low[y]);
        }
        else if(vis2[y]){
            low[x]=min(low[x],dfn[y]);
        }
    }
    if(low[x]==dfn[x]){
        id++;
        while(true){
            int tmp=Stack[Top];
            B[id].push_back(tmp);
            vis2[tmp]=0;
            Top--;
            if(tmp==x)break;
        }
    }
}

void solve(){
    cin>>n>>m>>Q;
    for(int i=0;i<=m;i++)query[i].clear();
    for(int i=1;i<=m;i++){
        string s;
        cin>>s;
        for(int j=1;j<=n;j++)v[j]=vis[i][j]=0;
        int c=0,pos;
        for(int j=1;j<=n;j++){
            int val=(s[2*j-2]-48)*50+(s[2*j-1]-48);
            to[i][j]=val;
            if(!v[val])v[val]=1,c++;
            else pos=val;
        }
        if(c==n){
            for(int j=1;j<=n;j++)vis[i][j]=1;
            op[i]=1;
        }
        else if(c==n-1){
            int nxt;
            for(int j=1;j<=n;j++)
                if(!v[j])nxt=j;
            for(int j=1;j<=n;j++)
                if(to[i][j]==pos)vis[i][j]=1,to[i][j]=nxt;
            op[i]=2;
        }
        else op[i]=0;
    }
    for(int i=1;i<=Q;i++){
        string s;
        cin>>s;
        int a,b,c;
        a=(s[0]-48)*50+s[1]-48;
        b=(s[2]-48)*50+s[3]-48;
        c=(s[4]-48)*50+s[5]-48;
        query[c].push_back({a,b,i});
    }
    for(int i=1;i<=n;i++)f[i]=i;
    vector<pair<int,int>>vec;
    for(int i=0;i<=m;i++){
        if(op[i]==1){
            for(int j=1;j<=n;j++)f[find(j)]=find(to[i][j]);
        }
        else if(op[i]==2){
            for(int j=1;j<=n;j++)if(vis[i][j])vec.emplace_back(j,to[i][j]);
        }
        for(int j=1;j<=n;j++)G[j].clear(),d[j]=0;
        Tm=Top=id=0;
        for(int j=1;j<=n;j++){
            dfn[j]=low[j]=vis2[j]=0;
            G2[j].clear();
            B[j].clear();
        }
        for(auto&[a,b]:vec){
            if(find(a)==find(b))continue;
            G[find(b)].push_back(find(a));
        }
        vector<int>t;
        for(int j=1;j<=n;j++)if(j==find(j))t.push_back(j);
        for(auto j:t)if(!dfn[j])tarjan(j);
        for(int k=1;k<=id;k++){
            for(int j=1;j<B[k].size();j++){
                f[find(B[k][j])]=find(B[k][0]);
            }
        }
        for(auto j:t){
            for(auto y:G[j]){
                if(find(j)!=find(y)){
                    G2[find(j)].push_back(find(y));
                    d[find(y)]++;
                }
            }
            dp[j].reset();
        }
        queue<int>q;
        for(int j=1;j<=n;j++){
            if(j==find(j)){
                dp[j].set(j);
                if(d[j]==0)q.push(j);
            }
        }
        while(!q.empty()){
            int x=q.front();
            q.pop();
            for(auto y:G2[x]){
                dp[y]|=dp[x];
                d[y]--;
                if(d[y]==0)q.push(y);
            }
        }
        for(auto&[a,b,c]:query[i]){
            a=find(a),b=find(b);
            if(dp[a][b]==1)ans[c]=1;
            else ans[c]=0;
        }
    }
    for(int i=1;i<=Q;i++)cout<<ans[i];
    cout<<endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int Te=1;
    cin>>Te;
    while(Te--){
        solve();
    }
}