#include <bits/stdc++.h>
using namespace std;
int getint(int c1,int c2){
    return (c1-48)*50+c2-48;
}
void solve()
{
    int n,m,q;cin>>n>>m>>q;   
    vector<vector<int>> a(m+1,vector<int>(n+1));
    for(int i=1;i<=m;i++){
        string s;cin>>s;
        for(int j=0;j<2*n;j+=2)a[i][j/2+1]=getint(s[j],s[j+1]);
        // for(int j=1;j<=n;j++)cout<<a[i][j]<<" \n"[j==n];
    }
    vector<vector<tuple<int,int,int>>> query(m+1);
    vector<int>ans(q);
    for(int i=0;i<q;i++){
        string s;cin>>s;
        int a=getint(s[0],s[1]);
        int b=getint(s[2],s[3]);
        int c=getint(s[4],s[5]);
        // cout<<"a="<<a<<" b="<<b<<" c="<<c<<endl;
        query[c].emplace_back(a,b,i);
        if(a==b)ans[i]=1;
    }
    vector<vector<int>> edge(n+1,vector<int>(n+1));
    for(int i=1;i<=n;i++)edge[i][i]=1;
    vector<vector<int>> ve(n+1);
    vector<int> f(n+1);iota(f.begin(),f.end(),0);
    function<int(int)> getf = [&](int x){
        if(x==f[x])return x;
        else return f[x]=getf(f[x]);
    };  
    
    auto addedge = [&](int x,int y){
        // cout<<"x="<<x<<" ---> y="<<y<<endl;
        ve[x].push_back(y);
        for(int r=1;r<=n;r++){
            queue<int>qu;
            if(edge[r][x]&&!edge[r][y])qu.push(y);
            while(!qu.empty()){
                int p=qu.front();qu.pop();
                if(edge[r][p])continue;
                // cout<<"r="<<r<<" p="<<p<<endl;
                edge[r][p]=1;
                for(auto it:ve[p])qu.push(it);
            }
        }
    };
    auto merge = [&](int x,int y){
        x=getf(x),y=getf(y);
        if(x==y)return false;
        f[y]=x;
        addedge(x,y);
        addedge(y,x);
        return true;
    };
    for(int i=1;i<=m;i++){
        vector<int> cnt(n+1);
        for(int j=1;j<=n;j++)cnt[a[i][j]]++;
        int cnt1=0,cnt2=0;
        for(int j=1;j<=n;j++){
            if(cnt[j]==1)cnt1++;
            if(cnt[j]==2)cnt2++;
        }
        if(cnt1==n){
            for(int j=1;j<=n;j++)merge(j,a[i][j]);
        }
        else if(cnt1==n-2&&cnt2==1){
            int x=0;
            for(int j=1;j<=n;j++)if(cnt[j]==2)x=j;
            vector<int>v;
            for(int j=1;j<=n;j++)if(a[i][j]==x){
                v.push_back(j);
            }
            for(int j=1;j<=n;j++)if(cnt[j]==0){
                addedge(v[1],j);
                addedge(v[0],j);
            }
        }
        for(auto [a,b,id]:query[i]){
            a=getf(a),b=getf(b);
            ans[id]=edge[a][b];
        }
    }
    for(int i=0;i<q;i++)cout<<ans[i];;cout<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;while(T--)solve();
    return 0;
}