#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve();
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)solve();
}
const int N=2003,M=1e6+3;
int a[N],b[N],f[N];
bool in[N];
int getf(int x){return x==f[x]?x:f[x]=getf(f[x]);}
vector<vector<pair<int,int>>>G;
void merge(int x,int y,int ti){
    x=getf(x);y=getf(y);
    if(x==y)return;
    G[x].emplace_back(y,ti);
    G[y].emplace_back(x,ti);
    // cerr<<x<<" "<<y<<" "<<ti<<endl;
    f[y]=x;
}
int mn[N][N],n,l;
void dijkstra(int x){
    priority_queue<pair<int,int>>Q;
    Q.emplace(0,x);
    for(int i=1;i<=n;i++)mn[x][i]=l+1;
    mn[x][x]=0;
    while(Q.size()){
        auto [t,u]=Q.top();
        Q.pop();
        t=-t;
        if(t>mn[x][u])continue;
        for(auto [v,ti]:G[u]){
            if(ti<mn[x][v]){
                mn[x][v]=ti;
                Q.emplace(-ti,v);
            }
        }
    }
}
void solve(){
    int q;
    cin>>n>>l>>q;
    G.clear();G.resize(n+1);
    for(int i=1;i<=n;i++){
        f[i]=i;
    }
    for(int u=1;u<=l;u++){
        string s;
        cin>>s;
        int x,y,z=0;
        for(int j=1;j<=n;j++)b[j]=0;
        for(int i=0,j=1;i<s.size();i+=2,j++){
            a[j]=(s[i]-48)*50+s[i+1]-48;
            if(b[a[j]]){
                x=b[a[j]];
                y=j;
            }
            b[a[j]]=j;
        }
        
        int ct=0;
        for(int j=1;j<=n;j++)if(b[j]==0)z=j,++ct;
        if(ct>1)continue;
        if(z){
            G[x].emplace_back(z,u);
            G[y].emplace_back(z,u);
            continue;
        }

        for(int i=1;i<=n;i++)in[i]=0;
        for(int i=1;i<=n;i++){
            if(in[i])continue;
            for(int j=i,k=a[i];k!=i;j=k,k=a[k]){
                in[a[k]]=1;
                merge(j,k,u);
            }
        }
    }
    for(int i=1;i<=n;i++)dijkstra(i);
    string res;
    while(q--){
        int a,b,c;
        string s;
        cin>>s;
        a=(s[0]-48)*50+s[1]-48;
        b=(s[2]-48)*50+s[3]-48;
        c=(s[4]-48)*50+s[5]-48;
        res+=(mn[a][b]<=c?'1':'0');
    }
    cout<<res<<endl;

}