#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define Rep(i,a,b) for(int i=a;i>=(b);i--)
#define pb push_back
#define mid(l,r) (l+(r-l)/2)
#define MID(l,r) (l+(r-l+1)/2)
#define MEM(a,x) memset(a,x,sizeof(a))
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define lson(k) (k<<1)
#define rson(k) (k<<1|1)
#define lowbit(x) ((x)&-(x))
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef __int128_t i128;
const int mod=1e9+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int qpow(int a,int b,int P=mod){int res=1;a%=P;assert(b>=0);for(;b;b>>=1){if(b&1)res=1ll*res*a%P;a=1ll*a*a%P;}return res;}
// Think twice,code once
inline int rd() {
	char c = getchar();
	while (c < 48) c = getchar();
	return (c - 48) * 50 + getchar() - 48;
}
void solve(){
    int n,l,q;cin>>n>>l>>q;
    vvi p(l,vi(n));
    rep(i,0,l)rep(j,0,n)p[i][j]=rd()-1;
    vi ans(q);
    vector<vector<array<int,3>>>qry(l);
    rep(i,0,q){
        int a=rd()-1,b=rd()-1,c=rd()-1;
        if(c==-1)ans[i]=(a==b);
        else qry[c].pb({a,b,i});
    }
    vi fa(n);iota(all(fa),0);
    auto find=[&](auto self,int x)->int{
        return fa[x]==x?x:fa[x]=self(self,fa[x]);
    };
    vector<pii>e;
    const int N=2005;
    vector<bitset<N>>bs(n);
    int sccn;vi scc(n),vis(n),ord;
    vvi g(n),rg(n);
    auto dfs1=[&](auto self,int u)->void{
        vis[u]=1;
        for(auto v:g[u])if(!vis[v]){
            self(self,v);
        }
        ord.pb(u);
    };
    auto dfs2=[&](auto self,int u,int rt)->void{
        scc[u]=sccn;
        fa[find(find,u)]=rt;
        for(auto v:rg[u])if(scc[v]==-1){
            self(self,v,rt);
        }
    };
    auto rebuild=[&](){
        sccn=-1,ord.clear();
        rep(i,0,n){
            scc[i]=-1,vis[i]=0;
            g[i].clear(),rg[i].clear();
        }
        for(auto[u,v]:e){
            u=find(find,u),v=find(find,v);
            g[u].pb(v),rg[v].pb(u);
        }
        rep(i,0,n)if(i==find(find,i)&&!vis[i])dfs1(dfs1,i);
        reverse(all(ord));
        for(auto u:ord)if(scc[u]==-1){sccn++;dfs2(dfs2,u,find(find,u));};
        rep(i,0,sccn+1){
            rg[i].clear();
            bs[i].reset(),bs[i][i]=true;
        }
        for(auto[u,v]:e){
            u=scc[find(find,u)],v=scc[find(find,v)];
            rg[v].pb(u);
        }
        Rep(u,sccn,0)for(auto v:rg[u])bs[v]|=bs[u];
    };
    rep(i,0,l){
        vi cnt(n);
        int cnt1=0;
        rep(j,0,n){
            if(cnt[p[i][j]]++)cnt1++;
        }
        if(cnt1<=1){
            if(!cnt1)rep(j,0,n)fa[find(find,j)]=find(find,p[i][j]);
            else{
                int v=-1;
                rep(j,0,n)if(!cnt[j])v=j;
                rep(j,0,n)if(cnt[p[i][j]]>1){
                    e.pb({j,v});
                }
            }
        }
        rebuild();
        for(auto[a,b,qi]:qry[i]){
            a=scc[find(find,a)],b=scc[find(find,b)];
            ans[qi]=bs[a][b];
        }
    }
    rep(i,0,q)cout<<ans[i];cout<<endl;
}
signed main(){
    int T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}