#include<iostream>
#include<cstring>
#include<vector>
#include<bitset>
#include<array>
using namespace std;
using LL = long long;
bitset<2000> bs[2000], rev[2000];

int main(){

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    auto input = [&]() -> int {
        char c1, c2;
        cin >> c1 >> c2;
        c1 -= 48;
        c2 -= 48;
        return c1 * 50 + c2;
    };

    int T;
    cin >> T;
    while(T--){
        int n, l, q;
        cin >> n >> l >> q;
        vector<int> cnt(n);
        vector<vector<pair<int, int> > > edge(l);
        for(int i = 0; i < l; i++){
            cnt.assign(n, 0);
            vector<int> p;
            vector<int> a(n);
            for(int j = 0; j < n; j++){
                a[j] = input() - 1;
                if (cnt[a[j]]) p.push_back(a[j]);
                cnt[a[j]] += 1;
            }
            if (p.empty()){
                for(int j = 0; j < n; j++){
                    edge[i].push_back({j, a[j]});
                }
            }
            else if (p.size() == 1){
                int p0 = 0;
                while(cnt[p0] != 0) p0++;
                for(int j = 0; j < n; j++){
                    if (a[j] == p[0]){
                        edge[i].push_back({j, p0});
                    }
                }
            }
        }
        vector<int> ans(q);
        vector<vector<array<int, 3> > > query(l);
        for(int i = 0; i < q; i++){
            int a = input() - 1;
            int b = input() - 1;
            int c = input() - 1;
            if (c != -1){
                query[c].push_back({a, b, i});
            }
            else{
                ans[i] = (a == b);
            }
        }
        for(int i = 0; i < n; i++){
            bs[i].reset();
            bs[i].set(i);
            rev[i].reset();
            rev[i].set(i);
        }
        for(int i = 0; i < l; i++){
            for(auto [a, b] : edge[i]){
                if (!bs[a].test(b)){
                    auto p1 = rev[a] & ~rev[b];
                    auto p2 = bs[b] & ~bs[a];
                    for(auto j = p1._Find_first(); j < n; j = p1._Find_next(j)){
                        bs[j] |= bs[b];
                    }
                    for(auto j = p2._Find_first(); j < n; j = p2._Find_next(j)){
                        rev[j] |= rev[a];
                    }
                }
            }
            for(auto [a, b, id] : query[i]){
                ans[id] = bs[a].test(b);
            }
        }
        for(auto x : ans) cout << x;
        cout << '\n';
    }

}