// 前を向け 終わらないさ 
// 一生僕らは生きて征け
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define ll long long
#define WA cerr<<"meowww!\n";
#define eps 1e-5
#define none -1145141919
#define pii pair<int,int>
#define Y cout<<"Yes\n"
#define N cout<<"No\n"
#define H cout<<"\n";
#define WH cerr<<"\n";
#define fi first
#define se second
#define C continue;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
#define ROF(i,a,b) for(int i=(a);i>(b);--i)
#define G(i,p) for(auto i:pq[p])
#define VG(i,p) for(int i=0;i<pq[p].size();i++)
#define pb push_back
#define pk pop_back
#define WR(x) cerr<<(x)<<"\n";
#define MAXN 2001
#define K cout<<" "
//#define int long long
//const int MOD=;
//void MD(int &x) { if(x<0) x+=MOD; if(x>=MOD) x-=MOD; return ; }
void Umn(int &x,int y) { if(x>y) x=y; return ; }
void Umx(int &x,int y) { if(x<y) x=y; return ; }
int rd() { char c1,c2;cin>>c1>>c2;int rt=(c1-'0')*50+(c2-'0');return rt;}
void wr(int x) { cout<<x; return ; }
int n,l,T; int t[MAXN][MAXN]; int i=0; int bx[MAXN]; int rc[MAXN]; int cf[MAXN];
//let i==no ball on ith
struct meow{int s,e,c,id;}; bool cmp(meow x,meow y) {return x.c<y.c;}
vector<meow> q; bitset<1000001> as; bitset<MAXN> v[MAXN];
int pc;
vector<int> pq[MAXN],re[MAXN]; int hs[MAXN]; vector<pii> all;
int dfn[MAXN],low[MAXN]; vector<int> pi; bitset<MAXN> vis;
int cnt=0; vector<int> ro[MAXN]; int nop[MAXN];
void pr()
{WA For(i,1,n) {For(j,1,n)cout<<v[i][j];H;}return ; }
void add(int x,int y) { if(nop[x]!=nop[y]) pq[nop[x]].pb(nop[y]); }
void tar(int p,int fa)
{
    dfn[p]=low[p]=++cnt; pi.pb(p); vis[p]=1;//WR(fa)
    G(i,p){
        if(!dfn[i]) { tar(i,p); Umn(low[p],low[i]); }
        if(vis[i]) { Umn(low[p],low[i]); }
    }
    if(low[p]==dfn[p]) {++pc; while(!pi.empty()) { int bk=pi.back(); pi.pk(); hs[bk]=pc; vis[bk]=0; if(bk==p) break; } }
    return ;
} int in[MAXN]; queue<int> tb; bool lv[MAXN]; bool el[MAXN][MAXN];
void pls(int c) {
    if(rc[c]==-1) return ; pc=0;
    if(rc[c]) { For(i,1,n) if(t[c][i]==cf[c]) { add(i,rc[c]); } }
    else { For(i,1,n) { add(i,t[c][i]); } } all.clear();
    For(i,1,n) G(j,i) all.pb(make_pair(i,j)); //for(auto i:all) cerr<<i.fi<<" "<<i.se<<"\n";
    vis.reset(); For(i,1,n) dfn[i]=low[i]=in[i]=0; For(i,1,n) { v[i].reset(); } cnt=0;
    For(i,1,n) if(!dfn[i]) { pi.clear(); tar(i,-1); } For(i,1,n) nop[i]=hs[nop[i]];
    For(i,1,pc) For(j,1,pc) el[i][j]=0; For(i,1,n) {pq[i].clear();re[i].clear();} 
    for(auto i:all) { int u=hs[i.fi],v=hs[i.se]; /*cerr<<i.fi<<" "<<i.se<<"\n";*/ if(u!=v&&!el[u][v]) { pq[u].pb(v);re[v].pb(u); in[u]++; el[u][v]=1; } }
    For(i,1,pc) { if(!in[i]) tb.push(i); } For(i,1,pc) v[i][i]=1,lv[i]=0; //WR(pc);
    while(!tb.empty()) 
    {
        int p=tb.front(); tb.pop(); //WR(p)
        for(auto i:re[p]) { in[i]--; if(in[i]==0) { tb.push(i); v[i]|=v[p]; } }
    }//For(i,1,n) cerr<<hs[i]<<" "; H;
    return ;
}
int main()
{
    //freopen("in2.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int _; cin>>_;
	for(int __=1;__<=_;__++)
	{
        q.clear(); as.reset(); For(i,1,n) v[i].reset(); cnt=0;
        cin>>n>>l>>T; For(i,1,n) v[i][i]=1; 
        For(i,1,n) nop[i]=i;
        For(i,1,l) { 
            bool ok=0; For(j,0,n)bx[j]=0; For(j,1,n) {t[i][j]=rd();++bx[t[i][j]];} int qw=0;
            For(j,1,n){ if(!bx[j]) qw=(qw==0)?(j):(-1); if(bx[j]>1) { cf[i]=j; } } 
            if(qw==-1) { rc[i]=-1; } else if(qw==0) { rc[i]=0; } else { rc[i]=qw; } 
        } //For(i,1,l) cerr<<rc[i]<<" ";
        int nc=0;
        For(i,1,T) { meow tp;tp.s=rd();tp.e=rd();tp.c=rd();tp.id=i;q.pb(tp); } sort(q.begin(),q.end(),cmp);
        for(auto i:q)
        {
            while(nc<i.c) { ++nc; pls(nc); } //pr();
            if(v[nop[i.s]][nop[i.e]]) { as[i.id]=1; }
        }
        For(i,1,T) cout<<as[i]; H;
	}
    return 0;
}
/*
Need check before submit

1.INF=1e9 check if the val>=1e9 and only 0x3f3f3f3f and 0 can be memset!!!
2.Don't using getchar() unless is NESSASARY!!!
3.Enough size for the array!!!
4.Notice double's precision
5.CHECK UR LL OR ULL!!!
6.READ THE PROBLEM AGAIN AND AGAIN!!!
7.Check if for() is over int

*/