#include<algorithm>
#include<iostream>
#include<cstdio>
#include<bitset>
using namespace std;
const int N = 2e3 + 5, M = 1e6 + 5;
int n, l, q;
int fa[N], siz[N];
int sta[N], top = 0;
bool ans[M];
string s;
bitset<N> bit[N];
struct query{
    int a, b, c, id;
}que[M];
struct bottom{
    int t[N];
}bot[N];

int decode(int idx){
    return ((s[idx] - 48) * 50 + s[idx + 1] - 48);
}

int find(int x){
    if(fa[x] == x) return x;
    return fa[x] = find(fa[x]);
}

void merge(int x, int y){
    if(siz[x] < siz[y]) swap(x, y);
    fa[y] = x;
    siz[x] += siz[y];
    for(int i = 1; i <= n; i ++){
        if(bit[i][y])
            bit[i][x] = 1;
    }
}

int vis[N], tot;
void dfs(int x, int idx){
    vis[x] = 1;
    sta[++top] = x;
    if(vis[bot[idx].t[x]]) return;
    dfs(bot[idx].t[x], idx);
}

void addedge(int idx){
    for(int i = 1; i <= n; i ++)
        vis[i] = 0;
    tot = 0;
    for(int i = 1; i <= n; i ++){
        int to = bot[idx].t[i];
        if(!vis[to]) ++tot;
        ++ vis[to];
    }
    if(tot == n){
        for(int i = 1; i <= n; i ++)
            vis[i] = 0;
        for(int i = 1; i <= n; i ++){
            if(!vis[i]){
                top = 0;
                dfs(i, idx);
                for(int j = 1, x, y; j < top; j ++){
                    x = find(sta[j]); y = find(sta[j + 1]);
                    if(x != y)
                        merge(x, y);
                }
            }
        }
    }
    else{
        int x1 = 0, x2 = 0, y;
        for(int i = 1; i <= n; i ++){
            if(!vis[i])
                y = i;
            if(vis[bot[idx].t[i]] == 2)
                if(!x1)
                    x1 = i;
                else
                    x2 = i;
        }
        x1 = find(x1);
        x2 = find(x2);
        y = find(y);
        for(int i = 1; i <= n; i ++){
            if(bit[i][x1] || bit[i][x2])
                bit[i] |= bit[y];
        }
    }
}

void init(){
    for(int i = 1; i <= q; i ++)
        ans[i] = 0;
    for(int i = 1; i <= n; i ++){
        fa[i] = i;
        siz[i] = 1;
    }
    for(int i = 1; i <= n; i ++){
        bit[i].reset();
        bit[i][i] = 1;
    }
}

int main(){
    ios::sync_with_stdio();
    int T;
    cin >> T;
    while(T --){
        cin >> n >> l >> q;
        init();
        for(int i = 1; i <= l; i ++){
            cin >> s;
            for(int idx = 1; idx <= n; idx ++){
                bot[i].t[idx] = decode((idx - 1) * 2);
            }
        }
        for(int i = 1; i <= q; i ++){
            cin >> s;
            que[i].id = i;
            que[i].a = decode(0);
            que[i].b = decode(2);
            que[i].c = decode(4);
        }
        sort(que + 1, que + 1 + q, [](query x, query y){
            return x.c < y.c;
        });
        for(int now = 0, i = 1; i <= q; i ++){
            while(now < que[i].c){
                addedge(++now);
            }
            if(bit[find(que[i].a)][find(que[i].b)])
                ans[que[i].id] = 1;
        }
        for(int i = 1; i <= q; i ++)
            cout << ans[i];
        cout << "\n";
    }
    return 0;
}