#include <bits/stdc++.h>
using namespace std;

#define fopen                      \
    freopen("in.txt", "r", stdin); \
    freopen("out.txt", "w", stdout);
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)
#define i64 long long
#define pii pair<int, int>
#define de(x) cout << #x << " = " << x << '\n'

const int N = 2e3 + 10, M = 1e6 + 10, mod = 1e9 + 7;
const double eps = 1e-6;

int t[N][N], dp[N][N];
array<int, 4> qu[M];
int ans[M], fa[N];
vector<int> vec[N];
int n, m, q;

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

void add(int k)
{
    vector<int> vis(n + 1, 0);
    int same = 0, left = 0;
    for (int i = 1, x; i <= n; i++)
    {
        x = t[k][i];
        if (vis[x])
        {
            if (!same)
                same = x;
            else
                return;
        }
        vis[x] = 1;
    }

    if (!same)
    {
        fill(vis.begin(), vis.end(), 0);
        for (int i = 1; i <= n; i++)
            if (t[k][i] != i && !vis[i])
            {
                int x = t[k][i], f = get(i);
                while (x != i)
                {
                    vis[x] = 1;
                    int fx = get(x);
                    if (fx != f)
                    {
                        fa[fx] = f;
                        for (int j = 1; j <= n; j++)
                            if (dp[f][j] == 0 && dp[fx][j] == 1)
                            {
                                dp[f][j] = 1;
                                vec[j].push_back(f);
                            }
                    }
                    x = t[k][x];
                }
            }
        return;
    }

    for (int i = 1; i <= n; i++)
        if (!vis[i])
            left = i;

    for (int i = 1; i <= n; i++)
        if (t[k][i] == same)
        {
            for (int x : vec[i])
            {
                x = get(x);
                if (!dp[x][left])
                    vec[left].push_back(x);
                dp[x][left] = 1;
            }
        }
}

void solve()
{
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++)
    {
        fa[i] = i;
        for (int j = 1; j <= n; j++)
            dp[i][j] = i == j;
        vec[i].resize(1, i);
    }

    for (int i = 1; i <= m; i++)
    {
        string s;
        cin >> s;
        for (int j = 1, x; j <= n; j++)
        {
            x = (s[j + j - 2] - 48) * 50 + (s[j + j - 1] - 48);
            t[i][j] = x;
        }
    }

    for (int i = 1, a, b, c; i <= q; i++)
    {
        string s;
        cin >> s;
        a = (s[0] - 48) * 50 + s[1] - 48;
        b = (s[2] - 48) * 50 + s[3] - 48;
        c = (s[4] - 48) * 50 + s[5] - 48;
        qu[i] = {c, a, b, i};
    }
    sort(qu + 1, qu + q + 1);
    for (int i = 1, k = 1; i <= q; i++)
    {
        auto [c, a, b, id] = qu[i];
        while (k <= c)
        {
            add(k);
            ++k;
        }
        a = get(a);
        ans[id] = dp[a][b];
    }
    for (int i = 1; i <= q; i++)
        cout << ans[i];
    cout << '\n';
}

signed main()
{
    // fopen;
    int t = 1;
    cin >> t;

    while (t--)
        solve();

    return 0;
}