#include<bits/stdc++.h>
#define LL long long
using namespace std;

int read() {
    int x = 0, w = 1;
    char ch = 0;
    while (ch < '0' || ch > '9') {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + (ch ^ 48);
       ch = getchar();
    }
    return x * w;
}

const int maxn = 2e3 + 5;
const int maxm = 1e6 + 5;

int T;
int n, m, Q;
struct node {
    int u, v, c, id;
}q[maxm];
bool cmp(node x, node y) {
    if (x.c != y.c) return x.c < y.c;
    return x.id < y.id;
}

char ch[maxn << 1];
int ans[maxm];
pair<int, int> edge[maxm];
int edge_cnt;

vector<int> G[maxn];

int main()
{
    T = read();
    while (T--) {
        n = read(); m = read(); Q = read();

        vector<vector<int>> t(m + 5, vector<int>(n + 5, 0));
        for (int i = 1; i <= m; i++) {
            scanf("%s", ch);
            for (int j = 0; j < n; j++) {
                int aa = (int)ch[j << 1] - 48, bb = (int)ch[j << 1 | 1] - 48;
                t[i][j + 1] = aa * 50 + bb;
            }
        }

        for (int i = 1; i <= Q; i++) {
            scanf("%s", ch);
            for (int j = 0; j < 3; j++) {
                int aa = (int)ch[j << 1] - 48, bb = (int)ch[j << 1 | 1] - 48;
                if (j == 0) q[i].u = aa * 50 + bb;
                if (j == 1) q[i].v = aa * 50 + bb;
                if (j == 2) q[i].c = aa * 50 + bb;
            }
            q[i].id = i;
        }
        sort(q + 1, q + 1 + Q, cmp);

        // for (int i = 1; i <= m; i++) {
        //     for (int j = 1; j <= n; j++)
        //         cout << t[i][j] << ' '; 
        //         cout << endl;
        // }

        int now = 1;
        while (now <= Q && q[now].c == 0) {
            if (q[now].u == q[now].v) ans[q[now].id] = 1;
            now++;
        }

        vector<int> col(n + 5, 0);
        for (int i = 1; i <= n; i++) col[i] = i;
        for (int k = 1; k <= m; k++) {
            vector<int> in(n + 5, 0);
            for (int i = 1; i <= n; i++) in[t[k][i]]++;

            int cnt = 0, pos0 = 0, pos2 = 0, ff = 1;
            for (int i = 1; i <= n; i++) {
                if (in[i] == 0) pos0 = i;
                if (in[i] == 2) pos2 = i, cnt++;
                if (in[i] >= 3) ff = 0;
            }
            if (cnt >= 2) ff = 0;

            // cout << pos0 << ' ' << pos2 <<' ' << cnt <<' '<<ff<<endl;
            if (ff) {
                if (cnt == 0) {
                    for (int i = 1; i <= n; i++) {
                        if (col[i] != col[t[k][i]]) G[i].push_back(t[k][i]);
                    }
                } else {
                    for (int i = 1; i <= n; i++) {
                        if (t[k][i] == pos2 && col[i] != col[pos0]) G[i].push_back(pos0), edge[++edge_cnt] = {i, pos0}; // , cout << i << ' ' << pos0 << endl;
                    }
                }
            }

            vector<int> dfn(n + 5, 0), low(n + 5, 0), l(n + 5, 0), ins(n + 5, 0);
            col.assign(n + 5, 0);
            int id = 0, top = 0, colcnt = 0;
            
            auto tarjan = [&] (auto self_tarjan, int cur) -> void {
                dfn[cur] = low[cur] = ++id;
                l[++top] = cur, ins[cur] = 1;
                for (int v : G[cur])
                    if (!dfn[v]) self_tarjan(self_tarjan, v), low[cur] = min(low[v], low[cur]);
                        else if (ins[v]) low[cur] = min(low[cur], dfn[v]);
                if (low[cur] == dfn[cur]) {
                    ++colcnt;
                    while (l[top] != cur) {
                        col[l[top]] = colcnt;
                        ins[l[top]] = 0;
                        top--;
                    }
                    col[cur] = colcnt;
                    ins[cur] = 0;
                    top--;
                }
            };

            for (int i = 1; i <= n; i++)
                if (!dfn[i]) tarjan(tarjan, i);
            // for (int i = 1; i <= n; i++) cout << col[i] << ' '; cout << endl;
            
            vector<vector<int>> GT(colcnt + 5, vector<int>());
            map<pair<int, int>, int> mp;
            in.assign(n + 5, 0);

            for (int i = 1; i <= edge_cnt; i++) {
                auto [x, y] = edge[i];
                x = col[x], y = col[y];
                if (x == y || mp.count({x, y})) continue;
                mp[{x, y}] = 1;
                in[y]++;
                GT[x].push_back(y);
            }

            queue<int> que;
            vector<int> vis(n + 5, 0);
            vector<bitset<maxn>> fff(colcnt + 5, bitset<maxn>());
            for (int i = 1; i <= colcnt; i++) {
                if (!in[i]) que.push(i);
                fff[i][i] = 1;
            }
            while (!que.empty()) {
                auto cur = que.front();
                que.pop();
                if (vis[cur]) continue;

                vis[cur] = 1;
                for (auto v : GT[cur]) {
                    fff[v] |= fff[cur];
                    in[v]--;
                    if (!in[v]) que.push(v);
                }
            }

            while (now <= Q && q[now].c == k) {
                auto [u, v, ccc, id] = q[now++];
                u = col[u], v = col[v];
                ans[id] = fff[v][u];
            }
        }

        for (int i = 1; i <= Q; i++)
            printf("%d", ans[i]);
        putchar('\n');


        for (int i = 1; i <= n; i++) G[i].clear();
        edge_cnt = 0;
        for (int i = 1; i <= Q; i++) ans[i] = 0;
    }


    return 0;
}

// todo :
// NULL

// done : 
// char * 50 范围
// ans 清空