#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define MAXN 1000100
#define fr first
#define se second
#define mp make_pair
#define pb push_back
int n,l,q;
char s[4010];
int t[2010][2010];
int dis[2010][2010];
struct query{
    int a,b,c,ans;
}Q[1000010];
int fa[4010];
vector<pair<int,int>>G[2020];
int get(int x) {
    if( fa[x] == x ) return fa[x];
    else {
        fa[x] = get( fa[x] );
        return fa[x];
    }
}
void init() {
    rep(i,1,l) {
        scanf("%s",s+1);
        for(int j = 2;j <= 2*n;j += 2)
            t[i][j/2] = (int)(s[j-1]-'0') * 50 + (int)(s[j]-'0');
    }
    rep(j,1,q) {
        scanf("%s",s+1);
        Q[j].a = (int)(s[1]-'0') * 50 + (int)(s[2]-'0');
        Q[j].b = (int)(s[3]-'0') * 50 + (int)(s[4]-'0');
        Q[j].c = (int)(s[5]-'0') * 50 + (int)(s[6]-'0');
    }
}
bool vis_init[4010];
void insert1(int i) {
    rep(j,1,n) {
        int x = j , y = t[i][j] , fx = get(x) , fy = get(y);
        if( fx != fy ) {
            G[fx].pb( mp( fy , i ) );
            G[fy].pb( mp( fx , i ) );
            fa[fx] = fy;
        }
    }
}
void work() {
    rep(i,1,n) fa[i] = i;
    rep(i,1,l) {
        int cnt = 0 , z = -1 , pos = -1;
        rep(j,1,n) 
            if(!vis_init[t[i][j]]) vis_init[t[i][j]] = true , cnt++;
            else z = t[i][j];
        if( cnt <= n-2 );
        else if( cnt == n ) insert1(i);
        else {
            rep(j,1,n) if( !vis_init[j] ) pos = j;
            rep(j,1,n) if( t[i][j] == z && j != pos ) G[j].pb( mp( pos , i ) );
        }
        rep(j,1,n) vis_init[j] = false;
    }
}
priority_queue<pair<int,int>>qu;
void dijkstra() {
    rep(S,1,n) {
        rep(i,1,n) dis[S][i] = 1000000000;
        dis[S][S] = 0;
        qu.push( mp( 0 , S ) );
        while(!qu.empty()) {
            auto [ww,u] = qu.top(); qu.pop();
            if( dis[S][u] != -ww ) continue; 
            for(auto [v,w] : G[u]) {
                if( dis[S][v] > max(w,dis[S][u]) ) {
                    dis[S][v] = max(w,dis[S][u]);
                    qu.push( mp( -dis[S][v] , v ) );
                }
            }
        }
    }
    rep(i,1,q) {
        if( dis[Q[i].a][Q[i].b] <= Q[i].c ) putchar('1');
        else putchar('0');
    }
    putchar('\n');
}
void reset() {
    rep(i,1,n) G[i].clear();
}
int main() {
    int T; cin >> T;
    while(T--) {
        cin >> n >> l >> q;
        init();
        work();
        
        dijkstra();
        reset();
    }
    return 0;
}