#include<bits/stdc++.h>
#define int long long
#define Pa pair<int,int>
using namespace std;
const int N=2e3+10,inf=1e9;
void read(int &x){
    char a,b;cin>>a>>b;
//    cout<<a<<' '<<b<<'\n';
    x=(a-48)*50+(b-48);
}
int n,l,q;
struct DSU{
    int fa[N];
    void init(){
        for(int i=1;i<=n;i++)fa[i]=i;
    }
    int find(int x){
        if(fa[x]==x)return x;
        return fa[x]=find(fa[x]);
    }
    void merge(int x,int y){
        x=find(x),y=find(y);
        if(x==y)return;
        fa[x]=y;
    }
}dsu;
int t[N];
vector<Pa>e[N];
int d[N][N];
void solve(){
    cin>>n>>l>>q;
    dsu.init();
    for(int i=1;i<=n;i++){
        e[i].clear();
        for(int j=1;j<=n;j++){
            d[i][j]=inf;
        }
    }
    for(int i=1;i<=l;i++){
        vector<int>cnt(n+1,0);
        int flag=1,f0=-1,f2=-1;
        for(int j=1;j<=n;j++){
            read(t[j]);
            cnt[t[j]]++;
        }
        for(int j=1;j<=n;j++){
            if(cnt[j]==0){
                if(f0==-1)f0=j;
                else flag=0;
            }
            if(cnt[j]==2){
                if(f2==-1)f2=j;
                else flag=0;
            }
            if(cnt[j]>2)flag=0;
        }
        if(flag==0)continue;
        if(f0==-1){
            for(int j=1;j<=n;j++){
                int x=dsu.find(j),y=dsu.find(t[j]);
                if(x!=y){
                    dsu.merge(x,y);
                    e[x].push_back({y,i});
                    e[y].push_back({x,i});
                }
            }
        }
        else{
            for(int j=1;j<=n;j++){
                if(cnt[t[j]]==2){
                    int x=j,y=f0;
                    e[x].push_back({y,i});
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        d[i][i]=0;
        priority_queue<Pa,vector<Pa>,greater<Pa>>q;
        q.push({0,i});
        vector<int>vis(n+1,0);
        while(!q.empty()){
            int u=q.top().second;q.pop();
            if(vis[u])continue;
            vis[u]=1;
            for(auto [v,val]:e[u]){
                if(d[i][v]>max(d[i][u],val)){
                    d[i][v]=max(d[i][u],val);
                    q.push({d[i][v],v});
                }
            }
        }
    }
    while(q--){
        int a,b,c;
        read(a),read(b),read(c);
        if(d[a][b]<=c)cout<<1;
        else cout<<0;
    }
    cout<<'\n';
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T=1;cin>>T;
	while(T--)solve();
}