#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 2005;

int getNum(char a, char b) {
    return (int(a) - 48) * 50 + int(b) - 48;
}

struct Ask {
    int a, b, c, id;
};

int t[N][N];
std::bitset<N> lt[N];

void solve() {
    int n, l, q;
    std::cin >> n >> l >> q;
    std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
    for (int i = 1; i <= l; i++) {
        std::string s;
        std::getline(std::cin, s);
        for (int j = 1; j <= n; j++) {
            t[i][j] = getNum(s[j * 2 - 2], s[j * 2 - 1]);
        }
    }
    std::vector<Ask> ask(q + 1);
    for (int i = 1; i <= q; ++i) {
        int a, b, c;
        std::string s;
        std::getline(std::cin, s);
        a = getNum(s[0], s[1]);
        b = getNum(s[2], s[3]);
        c = getNum(s[4], s[5]);
        ask[i] = {a, b, c, i};
    }
    std::sort(ask.begin() + 1, ask.end(), 
        [&](auto x, auto y) { 
            return x.c < y.c; 
        });
    std::vector<int> dsu(n + 1), ans(q + 1);
    for (int i = 1; i <= n; i++) {
        dsu[i] = i;
        for(int j = 1; j <= n; j ++){
            lt[i][j] = 0;
        }
        lt[i][i] = 1;
    }
    std::function<int(int)> find = [&](int x) {
        return dsu[x] == x ? x : dsu[x] = find(dsu[x]);
    };

    auto merge = [&](int x, int y) {
        x = find(x), y = find(y);
        if(x == y){
            return;
        }
        dsu[x] = y;
        // std::cout << x << " " << y << " merge\n";

        lt[y] |= lt[x];
        for(int i = 1; i <= n; i ++){
            lt[i][y] = lt[i][y] | lt[i][x];
        }
    };

    int p = 1;
    while (p <= q && ask[p].c == 0) {
        if (lt[find(ask[p].b)][find(ask[p].a)]) {
            ans[ask[p].id] = 1;
        }
        p++;
    }
    for (int i = 1; i <= l; i++) {
        int kd = 0, chong = 0;
        std::set<int> set;
        for (int j = 1; j <= n; j++) {
            if(t[i][j] > n){
                chong = 2;
            }
            if (set.count(t[i][j])) {
                chong++;
                kd = t[i][j];
            }
            set.insert(t[i][j]);
        }
        if (chong == 0) {
            // std::cout << i << " first\n";
            for (int j = 1; j <= n; j++) {
                merge(j, t[i][j]);
            }
        } else if (chong == 1) {
            std::vector<int> x;
            int y;
            for (int j = 1; j <= n; j++) {
                if (t[i][j] == kd) {
                    x.push_back(j);
                }
                if (!set.count(j)) {
                    y = j;
                }
            }
            // std::cout << i << " " << y << "<-";
            for (auto xx : x) {
                // std::cout << xx << " ";
                int ny = find(y), nx = find(xx);
                // std::cout << nx << " " << ny << "\n";
                for(int j = 1; j <= n; j ++){
                    if(lt[j][nx]){
                        lt[j] |= lt[ny];
                    }
                }
            }
            // std::cout << "second\n";
        }
        while (p <= q && ask[p].c == i) {
            if (lt[find(ask[p].a)][find(ask[p].b)]) {
                ans[ask[p].id] = 1;
            }
            p++;
        }
    }

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

    // for(int i = 1; i <= n; i ++){
    //     for(int j = 1; j <= n; j ++){
    //         std::cout << lt[i][j] << " \n"[j == n];
    //     }
    // }
    // for(int i = 1; i <= n; i ++){
    //     std::cout << find(i) << " ";
    // }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    std::cin >> t;
    while (t--) {
        solve();
    }
}