#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 * 10], nxt[N * N * 10], tot;
std::vector<int> deg(N, 0);
void add(int x, int y)
{
    ver[++tot] = y;
    nxt[tot] = hd[x], hd[x] = tot;
}
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;


int dfn[N], low[N], dfntot;
int stack[N], top, ins[N];
int col[N], colcnt;
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]) {
        ++colcnt;
        int y;
        do {
            y = stack[top--]; ins[y] = 0;
            col[y] = colcnt;
        } while (x != y);
    }
}

int ans[Q];

int main()
{
    int T;
    std::cin >> T;
    while (T--) {
        for (int i = 1; i <= n; i++) hd[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++) col[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++;
        }
        std::vector<pii> edge;
        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) {
                        if (col[j] == col[ed[i]]) continue;
                        add(j, ed[i]);
                        edge.emplace_back(j, ed[i]);
                    }
                }
            } else if (!flag[i]) {
                for (int j = 1; j <= n; j++) {
                    if (col[j] == col[t[i][j]]) continue;
                    add(j, t[i][j]);
                }
            }
            for (int j = 1; j <= n; j++) {
                dfn[j] = low[j] = col[j] = 0;
            }
            colcnt = 0;
            dfntot = 0;
            for (int j = 1; j <= n; j++) {
                if (!dfn[j]) tarjan(j);
            }
            std::vector<std::vector<int>> GT(colcnt + 5, std::vector<int>());
            std::map<pii, int> mp;
            std::vector<std::bitset<N>> bits(colcnt + 5, std::bitset<N>());
            deg.assign(n + 5, 0);
            for (auto x : edge) {
                int f1 = col[x.first], f2 = col[x.second];
                if (f1 == f2 || mp.count({f1, f2})) continue;
                mp[{f1, f2}] = 1;
                deg[f2]++;
                GT[f1].emplace_back(f2);
            }
            std::queue<int> qu;
            while (!qu.empty()) qu.pop();
            std::vector<int> vis(n + 5, 0);
            for (int j = 1; j <= colcnt; j++) {
                if (!deg[j]) qu.push(j);
                bits[j][j] = 1;
            }
            int cnt = 0;
            while (!qu.empty()) {
                int x = qu.front(); qu.pop();
                if (vis[x]) continue;
                vis[x] = 1;
                for (auto y : GT[x]) {
                    bits[y] |= bits[x];
                    if (!--deg[y]) qu.push(y);
                }
            }
            while (que[qnow].c == i && qnow <= q) {
                int fa = col[que[qnow].a], fb = col[que[qnow].b];
                if (bits[fb][fa] == 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;
}