#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second

using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = pair<int, int>;

constexpr int maxn = 2002;

string s;
int n, l, q;
array<int, maxn> c, fa, tp;
array<vector<int>, maxn> nxt, ext;
array<array<int, maxn>, maxn> t, e;

int find(int x) {
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}

int cur, top, cnt;
array<int, maxn> dfn, low, stk, vis, blk;
array<bitset<maxn>, maxn> to;

void tarjan(int u) {
    dfn[u] = low[u] = ++cur, stk[++top] = u, vis[u] = 1;
    for (int v : nxt[u])
        if (!dfn[v = find(v)])
            tarjan(v), low[u] = min(low[u], low[v]);
        else if (vis[v])
            low[u] = min(low[u], dfn[v]);
    if (dfn[u] == low[u] && ++cnt)
        do
            blk[stk[top]] = cnt, vis[stk[top]] = 0;
        while (stk[top--] != u);
    return;
}

struct node {
    int a, b, id;
};
array<int, maxn> ans;
array<vector<node>, maxn> p;

void solve() {
    cin >> n >> l >> q;
    for (int i = 1; i <= n; i++)
        fa[i] = i, nxt[i].clear();
    for (int i = 1; i <= l; i++)
        p[i].clear();

    
    for (int i = 1; i <= l; i++) {
        cin >> s;
        for (int j = 1, k = 0; j <= n; k += 2, j++)
            t[i][j] = (s[k] - 48) * 50 + (s[k + 1] - 48);
        for (int j = 0; j <= n; j++)
            c[j] = 0;
        for (int j = 1; j <= n; j++)
            c[0] += !c[t[i][j]]++;
        if (c[0] == n) {
            tp[i] = 1;
            for (int j = 1; j <= n; j++)
                e[i][j] = t[i][j];
        } else if (c[0] == n - 1) {
            tp[i] = 2;
            int from, to;
            for (int j = 1; j <= n; j++)
                if (!c[j])
                    to = j;
                else if (c[j] == 2)
                    from = j;
            for (int j = 1; j <= n; j++)
                if (t[i][j] == from)
                    e[i][j] = to;
                else
                    e[i][j] = 0;
        } else
            tp[i] = 0;
    }
    for (int i = 1; i <= q; i++) {
        cin >> s;
        int a = (s[0] - 48) * 50 + (s[1] - 48);
        int b = (s[2] - 48) * 50 + (s[3] - 48);
        int c = (s[4] - 48) * 50 + (s[5] - 48);
        p[c].push_back({a, b, i});
        if (i == 4986) {
            cout << a << " " << b << " " << c << endl;
            exit(0);
        }
    }
    for (int i = 0; i <= l; i++) {
        if (tp[i] == 1) {
            for (int j = 1; j <= n; j++) {
                int x = find(j), y = find(e[i][j]);
                if (x != y) {
                    for (int k : nxt[x])
                        nxt[y].emplace_back(k);
                    fa[x] = y;
                }
            }
        } else if (tp[i] == 2) {
            for (int j = 1; j <= n; j++)
                if (e[i][j])
                    nxt[find(j)].emplace_back(e[i][j]);
        }
        cur = top = cnt = 0;
        for (int j = 1; j <= n; j++)
            dfn[j] = blk[j] = 0, ext[j].clear();
        for (int j = 1; j <= n; j++)
            if (find(j) == j && !dfn[j])
                tarjan(j);
        for (int j = 1; j <= n; j++)
            if (find(j) == j)
                for (int k : nxt[j])
                    if (blk[j] != blk[k = find(k)])
                        ext[blk[k]].emplace_back(blk[j]);
        for (int i = 1; i <= cnt; i++)
            to[i].reset(), to[i].set(i);
        for (int i = 1; i <= cnt; i++)
            for (int j : ext[i])
                to[j] |= to[i];
        for (auto [a, b, id] : p[i])
            ans[id] = to[blk[find(a)]].test(blk[find(b)]);
    }
    for (int i = 1; i <= q; i++)
        cout << ans[i];
    cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tc = 1;
    cin >> tc;
    while (tc--) {
        solve();
    }
    return 0;
}