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

const int N = 2010, Q = 1e6 + 10;

bitset<N> g[N];

vector<pair<int, int>> edges[N];
int to[N][N];
int n, l, q;

void getedge(int p) {
    vector<int> from[N];
    for (int i = 1; i <= n; i++)
        from[i].clear();
    for (int i = 1; i <= n; i++)
        from[to[p][i]].push_back(i);
    int p1 = -1, p2 = -1; bool flag = 1;
    for (int i = 1; flag && i <= n; i++) {
        if (from[i].size() > 2) flag = 0;
        else if (from[i].size() >= 2 && p1 != -1) flag = 0;
        else if (from[i].size() == 2) p1 = i;
        else if (from[i].size() == 0) p2 = i;
    }
    if (!flag) return;
    if (p1 == -1) {
        for (int i = 1; i <= n; i++)
            edges[p].emplace_back(i, to[p][i]);
    } else {
        int x = from[p1][0], y = from[p1][1], t = p2;
        edges[p].emplace_back(x, t);
        edges[p].emplace_back(y, t);
    }
}

void link(int u, int v) {
    if (g[u][v]) return;
    for (int i = 1; i <= n; i++)
        if (i == u || g[i][u]) g[i] |= g[v];
}

char str[N];

struct Query {
    int u, v, id;
    Query() { }
    Query(int x, int y, int z) : u(x), v(y), id(z) { }
};
vector<Query> qry[N];
char ans[Q];

void solve() {
    scanf("%d%d%d", &n, &l, &q);
    
    for (int i = 1; i <= n; i++) g[i].reset();
    for (int i = 0; i <= l; i++) {
        edges[i].clear();
        qry[i].clear();
    }
    for (int i = 1; i <= n; i++)
        memset(to[i], 0, sizeof(int) * (n + 1));
    for (int i = 1; i <= n; i++) g[i].set(i);
    
    for (int i = 1; i <= l; i++) {
        scanf("%s", str + 1);
        int tot = 1;
        for (int j = 1; j <= n; j++) {
            int x = (str[tot] - 48) * 50 + (str[tot + 1] - 48);
            tot += 2;
            to[i][j] = x;
        }
        getedge(i);
    }
    
    for (int i = 1; i <= q; i++) {
        scanf("%s", str + 1);
        int a = (str[1] - 48) * 50 + (str[2] - 48);
        int b = (str[3] - 48) * 50 + (str[4] - 48);
        int c = (str[5] - 48) * 50 + (str[6] - 48);
        qry[c].emplace_back(a, b, i);
    }
    
    for (int i = 0; i <= l; i++) {
        for (const auto & e : edges[i]) link(e.first, e.second);
        for (const auto & t : qry[i]) {
            // cout << t.u << ' ' << t.v << ' ' << g[t.u][t.v] << ' ' << i << endl;
            ans[t.id] = g[t.u][t.v] + '0';
        }
    }
    ans[q + 1] = 0;
    puts(ans + 1);
}

int main() {
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}