#include<iostream>
#include<vector>
#include<deque>
#include<cstdio>

using namespace std;

const int inf = 1e9 + 7;

int n, l, q, du[2005], fa[2005], dis[2005][2005], vis[2005];
vector<pair<int, int>> e[2005];
deque<int> blk[2005];
char s[20005];

int getfa(int o) {
    return (fa[o] == o) ? o : (fa[o] = getfa(fa[o]));
}

void init(int rk) {
    scanf("%s", s + 1);
    for (int i = 1; i <= n; i++) du[i] = 0;
    for (int i = 1; i <= n + n; i += 2) {
        int x = (s[i] - 48) * 50 + s[i + 1] - 48;
        du[x]++;
    }
    int cnt = 0, pos = 0, p = 0;
    for (int i = 1; i <= n; i++) {
        if (du[i] > 2) return;
        if (du[i] == 2) {
            cnt++;
            pos = i;
        }
        if (du[i] == 0) {
            p = i;
        }
    }
    if (cnt == 1) {
        for (int i = 1; i <= n + n; i += 2) {
            int x = (s[i] - 48) * 50 + s[i + 1] - 48;
            if (x == pos) {
                e[(i + 1) >> 1].emplace_back(p, rk);
            }
        }
    } else if (cnt == 0) {
        for (int i = 1; i <= n + n; i += 2) {
            int x = (s[i] - 48) * 50 + s[i + 1] - 48;
            int fx = getfa((i + 1) >> 1);
            int fy = getfa(x);
            if (fx != fy) {
                fa[fx] = fy;
                e[(i + 1) >> 1].emplace_back(x, rk);
                e[x].emplace_back((i + 1) >> 1, rk);
            }
        }
    }
}

void relax(int i, int o) {
    for (auto &[to, w]: e[o]) {
        if (dis[i][to] > max(dis[i][o], w)) {
            dis[i][to] = max(dis[i][o], w);
            blk[dis[i][to]].push_front(to);
        }
    }
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        scanf("%d%d%d", &n, &l, &q);
        for (int i = 1; i <= n; i++) e[i].clear();
        for (int i = 1; i <= n; i++) fa[i] = i;
        for (int i = 1; i <= l; i++) init(i);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dis[i][j] = inf;
                vis[j] = 0;
            }
            for (int j = 0; j <= l; j++) blk[j].clear();
            dis[i][i] = 0;
            blk[0].push_back(i);
            for (int j = 0; j <= l; j++) {
                while (!blk[j].empty()) {
                    if (!vis[blk[j].back()]) {
                        relax(i, blk[j].back());
                        vis[blk[j].back()] = 1;
                    }
                    blk[j].pop_back();
                }
            }
        }
        while (q--) {
            scanf("%s", s + 1);
            int a = (s[1] - 48) * 50 + s[2] - 48;
            int b = (s[3] - 48) * 50 + s[4] - 48;
            int c = (s[5] - 48) * 50 + s[6] - 48;
            if (dis[a][b] <= c) {
                putchar('1');
            } else {
                putchar('0');
            }
        }
        puts("");
    }
    return 0;
}