#include <bits/stdc++.h>
#define dbg(x) cerr<< (#x) << ":" << x << endl
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int maxn = 2005;
int read() {
    char c1, c2;
    cin >> c1 >> c2;
    return 50 * (c1 - 48) + c2 - 48;
}
int n, l, q;
struct DSU {
    int n;
    int f[maxn];
    DSU(int _n) {
        n = _n;
        iota(f + 1, f + 1 + n, 1);
    }
    int Find(int x) {
        if (f[x] == x) return x;
        return f[x] = Find(f[x]);
    }
    int Union(int x, int y) {
        x = Find(x), y = Find(y);
        if (x == y) return 0;
        f[x] = y;
        return 1;
    }
};
void Solve() {
    cin >> n >> l >> q;
    DSU dsu(n);  
    vector<vector<pair<int,int>>> G(n + 1);
    for (int i = 1; i <= l; i++) {
        vector<int> t(n + 1);
        vector<int> cnt(n + 1, 0);
        int ok = 0, zero = -1, mul = -1;
        for (int j = 1; j <= n; j++) {
            t[j] = read();
            cnt[t[j]]++;
        }
        for (int j = 1; j <= n; j++) {
            if (cnt[j] == 0) {
                if (zero == -1) zero = j;
                else ok = -1;
            }
            if (cnt[j] == 2) {
                if (mul == -1) mul = j;
                else ok = -1;
            }
        }
        if (ok == -1) continue;
        if (zero == -1) {
            for (int j = 1; j <= n; j++) {
                if (dsu.Union(j, t[j])) {
                    G[j].push_back({t[j], i});
                    G[t[j]].push_back({j, i});
                }
            }
        }
        else {
            for (int j = 1; j <= n; j++) {
                if (t[j] == mul) G[j].push_back({zero, i});
            }
        }
    }
    vector<vector<int>> dis(n + 1, vector<int>(n + 1, 1e9));
    for (int s = 1; s <= n; s++) {
        vector<bool> vis(n + 1);
        priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> q;
        dis[s][s] = 0;
        q.push({0, s});
        while (q.size()) {
            auto [d, cur] = q.top();
            q.pop();
            if (vis[cur]) continue;
            vis[cur] = 1;
            for (auto [v, w]: G[cur]) {
                if (dis[s][v] > max(dis[s][cur], w)) {
                    dis[s][v] = max(dis[s][cur], w);
                    q.push({dis[s][v], v});
                }
            }
        }
    }
    while (q--) {
        int a = read(), b = read(), c = read();
        if (dis[a][b] <= c) cout << '1';
        else cout << '0';
    }
    cout << endl;
}
int main() {
    //freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
    int T;
    cin >> T;
    while (T--){
        Solve();
    }
    return 0;
}