#include <bits/stdc++.h>
constexpr int N = 2e3 + 5;
constexpr int Q = 1e6 + 5;
typedef std::pair<int, int> pii;
int n, l, q;
int t[N][N], flag[N], st[N], ed[N];
int hd[N], ver[N * N], nxt[N * N], deg[N], tot;
void add(int x, int y, bool f)
{
    ver[++tot] = y;
    nxt[tot] = hd[x], hd[x] = tot;
    if (f) deg[y]++;
}
int decode()
{
    char ch1 = std::cin.get();
    while (ch1 < 48) ch1 = std::cin.get();
    char ch2 = std::cin.get();
    while (ch2 < 48) ch2 = std::cin.get();
    return (ch1 - 48) * 50 + (ch2 - 48);
}

struct Query
{
    int a, b, c, id;
    bool operator< (const Query& o) const {
        return c < o.c;
    }
}que[Q];
int qnow;
std::bitset<2005> bits[N];

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

int dfn[N], low[N], dfntot;
int stack[N], top, ins[N];
void tarjan(int x)
{
    dfn[x] = low[x] = ++dfntot;
    stack[++top] = x, ins[x] = 1;
    for (int i = hd[x]; i; i = nxt[i]) {
        int y = ver[i];
        if (!dfn[y]) {
            tarjan(y);
            low[x] = std::min(low[x], low[y]);    
        } else if (ins[y]) {
            low[x] = std::min(low[x], dfn[y]);
        }
    }
    if (dfn[x] == low[x]) {
        int fx = find(x), y;
        do {
            y = stack[top--]; ins[y] = 0;
            int fy = find(y);
            if (fx != fy) fa[fx] = fy;
        } while (x != y);
    }
}

void dfs(int x)
{
    int fx = find(x);   
    for (int i = hd[x]; i; i = nxt[i]) {
        int y = ver[i];
        int fy = find(y);
        if (fx == fy) continue;
        dfs(fy);
        bits[x] |= bits[fy];
    }
}
std::vector<pii>edge;
int topo[N];
int ans[Q];

int main()
{
    int T;
    std::cin >> T;
    while (T--) {
        for (int i = 1; i <= n; i++) hd[i] = deg[i] = 0;
        for (int i = 1; i <= l; i++) st[i] = ed[i] = flag[i] = 0;
        qnow = 1; tot = 0;
        std::cin >> n >> l >> q;
        for (int i = 1; i <= n; i++) {
            fa[i] = i;
        }
        for (int i = 1; i <= l; i++) {
            std::vector<int> judge(n + 1, 0);
            for (int j = 1; j <= n; j++) {
                t[i][j] = decode();
                judge[t[i][j]]++;
                if (judge[t[i][j]] >= 2) {
                    flag[i]++;
                    st[i] = t[i][j];
                }
            }
            if (flag[i] == 1) {
                for (int j = 1; j <= n; j++) {
                    if (judge[j] == 0) {
                        ed[i] = j;
                    }
                }
            }
        }
        for (int i = 1; i <= q; i++) {
            que[i].a = decode();
            que[i].b = decode();
            que[i].c = decode();
            que[i].id = i;
        }
        std::sort(que + 1, que + 1 + q);
        while (que[qnow].c == 0 && qnow <= q) {
            if (que[qnow].a == que[qnow].b) ans[que[qnow].id] = 1;
            else ans[que[qnow].id] = 0;
            qnow++;
        }
        for (int i = 1; i <= l; i++) {
            if (flag[i] == 1) {
                int now = st[i];
                for (int j = 1; j <= n; j++) {
                    if (t[i][j] == now) {
                        int fj = find(j), fe = find(ed[i]);
                        add(fj, fe, 0);
                    }
                }
                for (int j = 1; j <= n; j++) {
                    int fj = find(j);
                    dfn[fj] = low[fj] = deg[j] = 0;
                }
                dfntot = 0;
                for (int j = 1; j <= n; j++) {
                    int fj = find(j);
                    if (!dfn[fj]) tarjan(fj);
                }
                for (auto x : edge) {
                    int f1 = find(x.first), f2 = find(x.second);
                    if (f1 == f2) continue;
                    add(f1, f2, 1);
                }
                for (int j = 1; j <= n; j++) {
                    if (t[i][j] == now) {
                        int fj = find(j), fe = find(ed[i]);
                        if (fj == fe) continue;
                        add(fj, fe, 1);
                        edge.emplace_back(fj, fe);
                    }
                }

            } else if (!flag[i]) {
                for (int j = 1; j <= n; j++) {
                    int ft = find(t[i][j]), fj = find(j);
                    if (ft != fj) fa[ft] = fj;
                }
            }
            std::queue<int> qu;
            while (!qu.empty()) qu.pop();
            std::vector<int> vis(n + 1, 0);
            for (int j = 1; j <= n; j++) {
                int fj = find(j);
                if (vis[fj]) continue;
                vis[fj] = 1;
                if (!deg[fj]) qu.push(fj); 
            }
            int cnt = 0;
            while (!qu.empty()) {
                int x = qu.front(); qu.pop();
                int fx = find(x);
                topo[++cnt] = x;
                for (int i = hd[x]; i; i = nxt[i]) {
                    int y = ver[i];
                    int fy = find(y);
                    if (fx == fy) continue;
                    if (!--deg[fy]) qu.push(fy);
                }
            }
            for (int i = cnt; i >= 1; i--) {
                int x = topo[i];
                int fx = find(x);   
                bits[x].reset();
                bits[x][x] = 1;
                for (int i = hd[x]; i; i = nxt[i]) {
                    int y = ver[i];
                    int fy = find(y);
                    if (fx == fy) continue;
                    dfs(fy);
                    bits[x] |= bits[fy];
                }
            }
            while (que[qnow].c == i && qnow <= q) {
                int fa = find(que[qnow].a), fb = find(que[qnow].b);
                if (bits[fa][fb] == 1) ans[que[qnow].id] = 1;
                else ans[que[qnow].id] = 0;
                qnow++;
            }
        }
        for (int i = 1; i <= q; i++) {
            std::cout << ans[i];
        }
        std::cout << '\n';
    }
    return 0;
}