#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

const i64 N = 2010, M = 1e6 + 10;

i64 n, l, Q;
i64 g[N][N], p[N];
// bool f[N][N];
vector<i64> edges[N], redges[N];
struct node
{
    i64 a, b, c, ans;
} q[M];
map<i64, vector<i64>> vec;

i64 get(char a, char b)
{
    return ((i64)a - 48) * 50 + ((i64)b - 48);
}

i64 find(i64 x)
{
    if (p[x] != x)
        p[x] = find(p[x]);
    return p[x];
}

void add(i64 a, i64 b)
{
    if (a != b)
    {
        // cout << "add edge a: " << a << " b: " << b << '\n';
        edges[a].push_back(b);
        redges[b].push_back(a);
    }
}

bool extend(queue<i64> &q, unordered_map<i64, i64> &da, unordered_map<i64, i64> &db, bool rev)
{
    i64 d = da[q.front()];
    while (q.size() && da[q.front()] == d)
    {
        auto t = q.front();
        q.pop();

        if (rev)
        {
            for (auto v : redges[t])
                if (find(v) == v)
                {
                    if (db.count(v))
                        return true;
                    if (da.count(v))
                        continue;
                    da[v] = da[v] + 1;
                    q.push(v);
                }
        }
        else
        {
            for (auto v : edges[t])
                if (find(v) == v)
                {
                    if (db.count(v))
                        return true;
                    if (da.count(v))
                        continue;
                    da[v] = da[v] + 1;
                    q.push(v);
                }
        }
    }
    return false;
}

bool bfs(i64 a, i64 b)
{
    // cout << "query a: " << a << " b: " << b << '\n';
    if (a == b)
        return true;

    queue<i64> qa, qb;
    unordered_map<i64, i64> da, db;

    qa.push(a), qb.push(b);
    da[a] = db[b] = 0;

    while (qa.size() && qb.size())
    {
        bool t;
        if (qa.size() < qb.size())
            t = extend(qa, da, db, 0);
        else
            t = extend(qb, db, da, 1);

        if (t)
            return true;
    }
    return false;
}

void solve()
{
    cin >> n >> l >> Q;
    for (i64 i = 0; i <= n; i++)
    {
        p[i] = i;
        edges[i].clear(), redges[i].clear();
    }
    for (i64 i = 0; i <= l; i++)
        vec[i].clear();

    for (i64 i = 1; i <= l; i++)
        for (i64 j = 1; j <= n; j++)
        {
            char a, b;
            cin >> a >> b;
            g[i][j] = get(a, b);
        }

    for (i64 i = 1; i <= Q; i++)
    {
        char ch1, ch2;
        cin >> ch1 >> ch2;
        q[i].a = get(ch1, ch2);
        cin >> ch1 >> ch2;
        q[i].b = get(ch1, ch2);
        cin >> ch1 >> ch2;
        q[i].c = get(ch1, ch2);
        vec[q[i].c].push_back(i);
    }

    for (i64 i = 0; i <= l; i++)
    {
        set<i64> S;
        for (i64 j = 1; j <= n; j++)
            S.insert(g[i][j]);
        if (S.size() == n)
        {
            map<i64, i64> mp;
            for (i64 j = 1; j <= n; j++)
                if (!mp[j])
                {
                    for (i64 k = g[i][j]; k != j; k = g[i][k])
                    {
                        mp[k] = true;
                        i64 a = find(j), b = find(k);
                        if (a != b)
                        {
                            p[b] = a;
                        }
                    }
                }
        }
        else if (S.size() == n - 1)
        {
            i64 t = 1;
            while (S.count(t))
                t++;

            map<i64, i64> mp;
            for (i64 j = 1; j <= n; j++)
            {
                if (mp.count(g[i][j]))
                {
                    add(find(mp[g[i][j]]), find(t));
                    add(find(j), find(t));
                    break;
                }
                mp[g[i][j]] = j;
            }
        }

        for (i64 u : vec[i])
        {
            // cout << "i: " << i << " u: " << u << '\n';
            // cout << "a: " << q[u].a << " b: " << q[u].b << '\n';
            q[u].ans = bfs(find(q[u].a), find(q[u].b));
        }
    }

    for (i64 i = 1; i <= Q; i++)
        cout << q[i].ans;
    cout << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    i64 T = 1;
    cin >> T;
    while (T--)
        solve();

    return 0;
}