#include <bits/stdc++.h>
using namespace std;
int T,n,L,q,b[2005][2005],pos[2005][5],vis[2005],miss[2005],
    faz[2005],cnt,damn[2005];
vector<pair<pair<int,int>,int>> query[2005];
vector<int> G[2005];
pair<int,int> edge[4005];
string str;
int dfn[2005],low[2005],ind,inSt[2005],bcnt,belong[2005],deg[2005],ans[1000005];
stack<int> st;
bitset<2005> bs[2005];
int getRoot(int x)
{
    if (faz[x]==x) return x;
    return faz[x]=getRoot(faz[x]);
}
void add(int u,int v)
{
    G[u].push_back(v);
}
void Tarjan(int u)
{
    dfn[u]=low[u]=++ind;
    inSt[u]=1; st.push(u);
    for (auto v:G[u])
    {
        if (!dfn[v])
        {
            Tarjan(v);
            low[u]=min(low[u],low[v]);
        }
        else
        if (inSt[v]) low[u]=min(low[u],dfn[v]);
    }
    if (low[u]==dfn[u])
    {
        int v;
        bcnt++;
        do
        {
            v=st.top(); st.pop();
            belong[v]=bcnt;
            inSt[v]=false;
        } while (u!=v);
    }
    return;
}
queue<int> Q;
void BFS()
{
    for (int i=1;i<=n;i++)
        if (deg[i]==0)
            Q.push(i);
    while (!Q.empty())
    {
        int u=Q.front();Q.pop();
        for (auto v:G[u])
        {
            bs[v]|=bs[u];
            deg[v]--;
            if (deg[v]==0)
                Q.push(v);
        }
    }
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>T;
    while (T--)
    {
        cin >> n >> L >> q;
        for (int i=1;i<=L;i++)
        {
            damn[i]=0;
            cin >> str;
            str=" "+str;
            for (int j=1;j<=n;j++)
                vis[j]=0;
            for (int j=1;j<=n;j++)
            {
                b[i][j]=(str[j*2-1]-'0')*50+(str[j*2]-'0');
                vis[b[i][j]]++;
            }
            miss[i]=0;
            int notvis=0;
            for (int j=1;j<=n;j++)
                if (!vis[j])
                    miss[i]=j,notvis++;
            if (notvis>1) damn[i]=1;
            int cnt=0;
            for (int j=1;j<=n;j++)
                if (vis[b[i][j]]==2)
                    pos[i][++cnt]=j;
        }
        for (int i=1;i<=L;i++)
            query[i].clear();
        for (int i=1,u,v,lim;i<=q;i++)
        {
            cin >> str;
            str=" "+str;
            u=(str[1]-'0')*50+(str[2]-'0');
            v=(str[3]-'0')*50+(str[4]-'0');
            lim=(str[5]-'0')*50+(str[6]-'0');
            if (lim==0)
                ans[i]=(u==v);
            else
                query[lim].push_back({{u,v},i});
        }
        for (int i=1;i<=n;i++)
            faz[i]=i;
        cnt=0;
        for (int i=1;i<=L;i++)
        {
            if (!damn[i])
            {
                if (miss[i]==0)
                {
                    for (int j=1;j<=n;j++)
                    {
                        int x=getRoot(j),y=getRoot(b[i][j]);
                        if (x!=y) faz[x]=y;
                    }
                } else
                {
                    edge[++cnt].first=pos[i][1];
                    edge[ cnt].second=miss[i];
                    edge[++cnt].first=pos[i][2];
                    edge[ cnt].second=miss[i];
                }
            }
            for (int j=1;j<=n;j++)
                G[j].clear();
            for (int j=1;j<=cnt;j++)
                add(getRoot(edge[j].first),getRoot(edge[j].second));
            ind=bcnt=0;
            for (int j=1;j<=n;j++)
            {
                dfn[j]=low[j]=inSt[j]=0;
                belong[j]=0;
            }
            for (int j=1;j<=n;j++)
                if (!dfn[j]) Tarjan(j);
            for (int j=1;j<=n;j++)
                G[j].clear();
            for (int j=1;j<=bcnt;j++)
            {
                deg[j]=0;
                bs[j]=0;
                bs[j][j]=1;
            }
            for (int j=1;j<=cnt;j++)
                if (belong[getRoot(edge[j].first)]!=belong[getRoot(edge[j].second)])
                {
                    add(belong[getRoot(edge[j].first)],belong[getRoot(edge[j].second)]);
                    deg[belong[getRoot(edge[j].second)]]++;
                }
            BFS();
            for (auto [p,id]:query[i])
                if (bs[belong[getRoot(p.second)]][belong[getRoot(p.first)]])
                    ans[id]=1;
                else
                    ans[id]=0;
        }

        for (int i=1;i<=q;i++)
            cout << ans[i];
        cout << '\n';
    }
    return 0;
}