/*******************************
| Author:  DE_aemmprty
| Problem: Bull Farm
| Contest: Virtual Judge - QOJ
| URL:     https://vjudge.net/problem/QOJ-9319
| When:    2024-10-04 22:25:30
| 
| Memory:  1014 MB
| Time:    5000 ms
*******************************/
#include <bits/stdc++.h>
using namespace std;

long long read() {
    char c = getchar();
    long long x = 0, p = 1;
    while ((c < '0' || c > '9') && c != '-') c = getchar();
    if (c == '-') p = -1, c = getchar();
    while (c >= '0' && c <= '9')
        x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return x * p;
}

const int N = 2007;
const int M = 1e6 + 7;

struct Ans {
    long long t, c, id;
};

int n, l, q;
vector <Ans> qry[N];
int wjc[N][N * 2], len[N];
long long dis[N];
bool vis[N];
vector <pair <int, int> > to[N];
int fa[N], ans[M];
int cnt[N];
int a[N][N];

void init() { for (int i = 1; i <= n; i ++) fa[i] = i;}
int find(int x) { return x == fa[x] ? x : (fa[x] = find(fa[x]));}
int chger(char c1, char c2) { return (c1 - 48) * 50 + c2 - 48;}

void solve() {
    n = read(), l = read(), q = read();
    init();
    for (int i = 1; i <= n; i ++) {
        to[i].clear();
        qry[i].clear();
    }
    for (int i = 1; i <= q; i ++)
        ans[i] = 0;
    for (int i = 1; i <= l; i ++) {
        string s;
        cin >> s;
        int m = (int) s.size(), num = 0, ch[2] = {0, 0};
        for (int j = 1; j <= n; j ++)
            cnt[j] = 0;
        s = " " + s;
        for (int j = 1; j <= m; j += 2) {
            int x = chger(s[j], s[j + 1]);
            if (cnt[x] > 0) {
                ch[0] = cnt[x];
                ch[1] = (j + 1) / 2;
            } else if (cnt[x] == 0) {
                cnt[x] = (j + 1) / 2;
                num ++;
            }
            a[i][(j + 1) / 2] = x;
        }
        int sp = 0;
        for (int j = 1; j <= n; j ++)
            if (!cnt[j]) sp = j;
        if (num == n - 1) {
            to[ch[0]].push_back({sp, i});
            to[ch[1]].push_back({sp, i});
            // printf("%d -> %d\n", ch[0], sp);
            // printf("%d -> %d\n", ch[1], sp);
        } else if (num == n) {
            for (int j = 1; j <= n; j ++) {
                if (find(j) != find(a[i][j])) {
                    fa[find(j)] = find(a[i][j]);
                    to[j].push_back({a[i][j], i});
                    to[a[i][j]].push_back({j, i});
                }
            }
        }
    }
    for (int i = 1; i <= q; i ++) {
        string sx; cin >> sx; sx = " " + sx;
        int s = chger(sx[1], sx[2]);
        int t = chger(sx[3], sx[4]);
        int c = chger(sx[5], sx[6]);
        // printf("(s, t, c) = (%d, %d, %d)\n", s, t, c);
        qry[s].push_back({t, c, i});
    }
    for (int i = 1; i <= n; i ++) {
        for (int j = 1; j <= n; j ++) {
            dis[j] = 2e18;
            vis[j] = 0;
        }
        for (int j = 0; j <= l; j ++)
            len[j] = 0;
        dis[i] = 0;
        wjc[0][++ len[0]] = i;
        for (int d = 0; d <= l; d ++) {
            for (int j = 1; j <= len[d]; j ++) {
                int u = wjc[d][j];
                if (vis[u]) continue;
                vis[u] = 1;
                for (auto v : to[u])
                    if (dis[v.first] > max(d, v.second)) {
                        dis[v.first] = max(d, v.second);
                        wjc[dis[v.first]][++ len[dis[v.first]]] = v.first;
                    }
            }
        }
        // printf("start in %d : ", i);
        // for (int j = 1; j <= n; j ++)
        //     cout << dis[j] << ' '; cout << '\n';
        for (auto qx : qry[i])
            if (dis[qx.t] <= qx.c)
                ans[qx.id] = 1;
    }
    for (int i = 1; i <= q; i ++)
        cout << ans[i];
    cout << '\n';
}

signed main() {
    int t = read();
    while (t --) solve();
    return 0;
}