#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
const int N = 2010;
int n, m, q, t[N][N], ans[1000010], num[N];
bitset<N> b[N];
char s[N << 1];
struct Q {
    int a, b, c, id;
} que[1000010];
bool cmp (Q a, Q b) {
    return a.c < b.c;
}
void addedge (int x, int y) {
    if (b[x][y]) return;
    for (int i = 1; i <= n; i ++)
        if (b[i][x])
            b[i] |= b[y];
}
void addbutton (int id) {
    for (int i = 1; i <= n; i ++) num[i] = 0;
    int flag = 0;
    for (int i = 1; i <= n; i ++) {
        num[t[id][i]] ++;
        if (num[t[id][i]] > 2) return;
        if (num[t[id][i]] == 2) {
            if (flag) return;
            flag = t[id][i];
        }
    }
    if (flag) {
        int d = 0;
        for (int i = 1; i <= n; i ++)
            if (!num[i])
                d = i;
        for (int i = 1; i <= n; i ++)
            if (t[id][i] == flag) addedge(i, d);
    } else {
        for (int i = 1; i <= n; i ++)
            addedge(i, t[id][i]);
    }
}
void init () {
    scanf("%d%d%d", &n, &m, &q);
    for (int i = 1; i <= n; i ++) {
        b[i].reset();
        b[i][i] = 1;
    }
    for (int i = 1; i <= m; i ++) {
        scanf("%s", s + 1);
        for (int j = 1; j <= n; j ++)
            t[i][j] = (s[(j * 2) - 1] - 48) * 50 + (s[(j * 2)] - 48);
    }
    for (int i = 1; i <= q; i ++) {
        scanf("%s", s + 1);
        que[i].a = (s[1] - 48) * 50 + (s[2] - 48);
        que[i].b = (s[3] - 48) * 50 + (s[4] - 48);
        que[i].c = (s[5] - 48) * 50 + (s[6] - 48);
        que[i].id = i;
    }
    sort(que + 1, que + q + 1, cmp);
    int qtop = 0;
    for (int i = 1; i <= q; i ++) {
        while (qtop < que[i].c) {
            qtop ++;
            addbutton(qtop);
        }
        int j = i;
        while (j <= q) {
            if (b[que[j].a][que[j].b]) ans[que[j].id] = 1;
            else ans[que[j].id] = 0;
            if (que[j + 1].c != que[j].c) break;
            j ++;
        }
        i = j;
    }
    for (int i = 1; i <= q; i ++) printf("%d", ans[i]);
    printf("\n");
}
int main () {
    int t = 1;
    scanf("%d", &t);
    while (t --) init();
    return 0;
}