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

int T, n, l, q, p[N][N], cnt[N], bad[N];
char s[N * 2];
bool ans[1000050];

int trans(char a, char b) {
    a -= 48; b -= 48;
    return a * 50 + b;
}

struct query {
    int a, b, id;
};
vector<query> Q[N];

struct Graph {
    int dfn[N], low[N], bel[N], ins[N], ru[N], clock;
    bool vis[N];
    vector<int> to1[N], to2[N], vec;
    bitset<N> f[N];
    stack<int> s;

    void clear() {
        for (ri i = 1; i <= n; i++) to1[i].clear();
        for (ri i = 1; i <= n; i++) to2[i].clear();
        for (ri i = 1; i <= n; i++) ins[i] = 0;
        while (!s.empty()) s.pop();
        vec.clear();
    }

    void add_edge(int a, int b) {
        to1[a].push_back(b);
    }

    void tarjan(int x) {
        low[x] = dfn[x] = ++clock;
        s.push(x);
        ins[x] = 1;
        int i, l = to1[x].size(), t;
        for (i = 0; i < l; i++) {
            if (ins[to1[x][i]]) low[x] = min(low[x], dfn[to1[x][i]]);
            else {
                if (dfn[to1[x][i]] == 0) {
                    tarjan(to1[x][i]);
                    low[x] = min(low[x], low[to1[x][i]]);
                }
            }
        }
        if (dfn[x] == low[x]) {
            do {
                t = s.top();
                bel[t] = x;
                ins[t] = false;
                s.pop();
                if (t == x) break;
            } while (1);
        }
        return;
    }

    void dp(int x) {
        if (vis[x]) return;
        for (auto it = to2[x].begin(); it != to2[x].end(); it++) {
            int y = *it;
            dp(y);
            f[x] |= f[y];
        }
        vis[x] = 1;
    }

    void init() {
        clock = 0;
        for (ri i = 1; i <= n; i++) {
            dfn[i] = low[i] = 0;
            sort(to1[i].begin(), to1[i].end());
            to1[i].resize(unique(to1[i].begin(), to1[i].end()) - to1[i].begin());
        }
        for (ri i = 1; i <= n; i++) if (!dfn[i]) tarjan(i);
        for (ri i = 1; i <= n; i++) if (i == bel[i]) vec.push_back(i);
        for (auto it = vec.begin(); it != vec.end(); it++) f[*it] = 0, ru[*it] = 0, vis[*it] = 0;
        for (auto it = vec.begin(); it != vec.end(); it++) f[*it][*it] = 1;
        for (ri i = 1; i <= n; i++) {
            for (auto it = to1[i].begin(); it != to1[i].end(); ++it) if (bel[i] != bel[*it]) {
                to2[bel[i]].push_back(bel[*it]);
                ru[bel[*it]]++;
            }
        }
        for (auto it = vec.begin(); it != vec.end(); it++) {
            sort(to2[*it].begin(), to2[*it].end());
            to2[*it].resize(unique(to2[*it].begin(), to2[*it].end()) - to2[*it].begin());
        }
        for (auto it = vec.begin(); it != vec.end(); it++) if (!ru[*it]) dp(*it);
    }
} G;

int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d%d", &n, &l, &q);
        for (ri i = 1; i <= l; i++) bad[i] = 0;
        for (ri i = 1; i <= q; i++) ans[i] = 0;
        for (ri i = 1; i <= n; i++) cnt[i] = 0;
        for (ri i = 1; i <= l; i++) {
            scanf("%s", s + 1);
            for (ri j = 1, cc = 0; j <= 2 * n; j += 2) {
                p[i][++cc] = trans(s[j], s[j + 1]);
            }
            for (ri j = 1; j <= n; j++) cnt[j] = 0;
            for (ri j = 1; j <= n; j++) cnt[p[i][j]]++;
            int cc = 0;
            for (ri j = 1; j <= n; j++) {
                if (cnt[j] > 2) bad[i] = 1;
                else if (cnt[j] == 2) cc++;
            }
            if (cc >= 2) bad[i] = 1;
            else if (cc == 1) {
                int x = -1, y = -1;
                for (ri j = 1; j <= n; j++) if (cnt[p[i][j]] == 2) {
                    if (x == -1) x = j; else y = j;
                }
                else {
                    p[i][j] = -1;
                }
                int wu;
                for (ri j = 1; j <= n; j++) if (cnt[j] == 0) wu = j;
                p[i][x] = wu; p[i][y] = wu;
            }
        }
        for (ri i = 0; i <= l; i++) Q[i].clear();
        for (ri i = 1; i <= q; i++) {
            scanf("%s", s + 1);
            int qa = trans(s[1], s[2]);
            int qb = trans(s[3], s[4]);
            int qc = trans(s[5], s[6]);
            Q[qc].push_back((query){qa, qb, i});
        }
        for (ri i = 0; i <= l; i++) if (Q[i].size()) {
            G.clear();
            for (ri j = 1; j <= i; j++) if (!bad[j]) {
                for (ri t = 1; t <= n; t++) if (t != p[j][t] && p[j][t] != -1) 
                    G.add_edge(t, p[j][t]);
            }
            G.init();
            for (auto it = Q[i].begin(); it != Q[i].end(); ++it) {
                ans[it->id] = G.f[G.bel[it->a]][G.bel[it->b]];
            }
        }
        for (ri i = 1; i <= q; i++) printf("%d", ans[i]);
        puts("");
    }
    return 0;
}