#pragma GCC Optimize("Ofast")

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <numeric>
#include <queue>
#include <cassert>
#include <cstring>
#include <climits>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <array>

using namespace std;
#define int long long

void solve()
{
    auto in = [] () {
        char a, b;
        cin >> a >> b;

        int x = a - 48;
        int y = b - 48;
        int z = x * 50 + y;
        return z;
    };

    int n, l, q;
    cin >> n >> l >> q;

    // cout << n << ' ' << l << ' ' << q << '\n';

    vector g(l + 5, vector(n + 5, 0LL));
    for (int i = 1; i <= l; i += 1) {
        for (int j = 1; j <= n; j += 1) {
            g[i][j] = in();
            // cout << g[i][j] << ' ';
        }
        // cout << '\n';
    }

    constexpr int N = 2000 + 5;
    vector<bitset<N>> f(N);
    for (int i = 1; i <= n; i += 1) f[i][i] = 1;

    auto connect = [&] (int a, int b) {
        if (f[a][b]) return;
        for (int i = 1; i <= n; i += 1) {
            if (f[i][a]) {
                f[i] |= f[b];
            }
        }
    };

    auto work = [&] (vector<int>& to) {
        vector vis(n + 5, 0LL);

        int j2 = 0;
        for (int i = 1; i <= n; i += 1) {
            if (vis[to[i]] == 0) vis[to[i]] = 1;
            else if (j2 == 0) j2 = to[i];
            else return;
        }

        if (j2 == 0) {
            for (int i = 1; i <= n; i += 1) connect(i, to[i]);
        } else {
            int j0 = 0;
            for (int i = 1; i <= n; i += 1) if (vis[i] == 0) j0 = i;
            for (int i = 1; i <= n; i += 1) if (to[i] == j2) connect(i, j0);
        }
    };

    vector qry(l + 5, vector<array<int, 3>> ());
    for (int i = 1; i <= q; i += 1) {
        int a = in(), b = in(), c = in();
        // cout << a << ' ' << b << ' ' << c << '\n';
        qry[c].push_back({i, a, b});
    }
    
    vector ans(q + 5, 0LL);
    for (int i = 0; i <= l; i += 1) {
        work(g[i]);
        for (auto [i, a, b] : qry[i]) {
            ans[i] = f[a][b];
        }
    }

    for (int i = 1; i <= q; i += 1) {
        cout << ans[i];
    }
    cout << '\n';
}

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

    int t = 1;
    cin >> t;

    while (t --) {
        solve();
    }

    return 0;
}