#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define tii tuple<int, int, int>
using namespace std;
bool debug = 1;
#define dbg(x)                                                   \
    if (debug)                                                   \
        cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) \
             << NORMAL_FAINT << COLOR_RESET << endl;
const string COLOR_RESET = "\033[0m", BRIGHT_CYAN = "\033[1;36m",
             NORMAL_FAINT = "\033[0;2m";

int trans(char ch1, char ch2) {
    int res = (ch1 - 48) * 50 + (ch2 - 48);
    return res;
}
const int N = 2003, M = 1e6 + 999;
int n, l, q, p[N][N], cnt[N], ans[M], vis[N], pos[N];
vector<tuple<int, int, int>> qy[N];
bitset<2002> bt[N];
void solve() {
    cin >> n >> l >> q;
    for (int i = 1; i <= n; i++)
        bt[i].reset(), qy[i].clear(), bt[i].set(i);
    for (int i = 1; i <= l; i++) {
        string st;
        cin >> st;
        for (int j = 1; j <= n; j++)
            p[i][j] = trans(st[j * 2 - 2], st[j * 2 - 1]);
    }
    for (int i = 1; i <= q; i++) {
        string st;
        cin >> st;
        int a, b, c;
        a = trans(st[0], st[1]);
        b = trans(st[2], st[3]);
        c = trans(st[4], st[5]);
        qy[c].push_back(tii(a, b, i));
    }
    for (auto [a, b, id] : qy[0])
        if (a == b)
            ans[id] = 1;
        else
            ans[id] = 0;
    for (int i = 1; i <= l; i++) {
        for (int j = 1; j <= n; j++)
            pos[j] = vis[j] = cnt[j] = 0;
        int flag = 0;
        for (int j = 1; j <= n; j++) {
            cnt[p[i][j]]++;
            flag = max(flag, cnt[p[i][j]]);
        }
        if (flag == 1) {
            for (int j = 1; j <= n; j++) {
                if (vis[j])
                    continue;
                int u = j;
                bitset<2002> tmp;
                while (1) {
                    if (vis[u])
                        break;
                    vis[u] = 1;
                    tmp |= bt[u];
                    u = p[i][u];
                }
                u = j;
                while (1) {
                    bt[u] |= tmp;
                    u = p[i][u];
                    if (u == j)
                        break;
                }
            }
        } else if (flag == 2) {
            int u, v, w;
            for (int j = 1; j <= n; j++) {
                if (pos[p[i][j]]) {
                    u = pos[p[i][j]];
                    v = j;
                }
                pos[p[i][j]] = j;
            }
            for (int j = 1; j <= n; j++)
                if (!pos[j])
                    w = j;
            for (int j = 1; j <= n; j++)
                if (bt[j][u] | bt[j][v])
                    bt[j] |= bt[w];
        }
        for (auto [a, b, id] : qy[i]) {
            if (bt[a][b] == 1)
                ans[id] = 1;
            else
                ans[id] = 0;
        }
    }
    for (int i = 1; i <= q; i++)
        cout << ans[i];
    cout << '\n';
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}

//__builtin_popcountll()
// cout<<fixed<<setprecision(2);