#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
using db = double;
constexpr int N = 1e6 + 50, LOGN = 30;
constexpr i64 P = 1e9 + 7, inf = 1e9;
struct DSU {
    vector<int> fa, sz;
    DSU() {}
    DSU(int n) { init(n); } 
    void init(int n){
        fa.resize(n);
        iota(fa.begin(), fa.end(), 0);
        sz.assign(n, 1);
    }
    int find(int x){ return fa[x] == x ? x : fa[x] = find(fa[x]); }
    bool merge(int x, int y) {
        x = find(x), y = find(y);
        if(x == y) return false;
        sz[x] += sz[y];
        fa[y] = x;
        return true;
    }
    bool same(int x, int y) { return find(x) == find(y); }
    int size(int x) { return sz[find(x)]; }
};

void solve(){
    int n, m, q; cin >> n >> m >> q;
    vector t(m + 1, vector<int> (n + 1));
    auto read = [&]() -> int {
        char a, b;
        cin >> a >> b;
        int x = (a - 48) * 50 + (b - 48); 
        return x;
    };
    DSU dsu(n + 1);
    vector<vector<array<int, 2>>> g(n + 1);
    for (int i = 1; i <= m; i++) {
        vector<int> vis(n + 1);
        for (int j = 1; j <= n; j++) {
            t[i][j] = read();
            vis[t[i][j]]++;
            
        }
        int cnt = 0;
        for (int j = 1; j <= n; j++) cnt += vis[j] != 0;
        if (cnt <= n - 2) continue;
        else if (cnt == n) {
            for (int j = 1; j <= n; j++) {
                if (dsu.merge(j, t[i][j])) {
                    g[j].push_back({t[i][j], i});
                    g[t[i][j]].push_back({j, i});
                }    
            }
        } else {
            int c2 = -1, c0 = -1;
            for (int j = 1; j <= n; j++) {
                if (vis[j] == 2) c2 = j;
                if (vis[j] == 0) c0 = j;
            }
            for (int j = 1; j <= n; j++) if (t[i][j] == c2) {
                g[j].push_back({c0, i});
            }
        }
    }
    vector dis(n + 1, vector<int>(n + 1, inf));
    for (int i = 1; i <= n; i++) dis[i][i] = 0;
    for (int i = 1; i <= n; i++) {
        priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> que;
        que.push({0, i});
        while (que.size()) {
            auto [val, u] = que.top(); que.pop();
            for (auto [v, w] : g[u]) {
                if (dis[i][v] > max(val, w)) {
                    dis[i][v] = max(val, w);
                    que.push({dis[i][v], v});
                }
            }
        }
    }
    while (q--) {
        int a = read(), b = read(), c = read();
        cout << (dis[a][b] <= c);
    }
    cout << "\n";
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cout << setprecision(15) << fixed;
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}