#include <bits/stdc++.h>

using namespace std;

#define SZ(x) ((int)((x).size()))
#define lb(x) ((x) & (-(x)))
#define bp(x) __builtin_popcount(x)
#define bpll(x) __builtin_popcountll(x)
#define mkp make_pair
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;

const int INF = 0x3f3f3f3f;

struct Dsu {
    vector<int> fa;
    void init(int n) {
        fa.resize(n + 1, 0);
        for (int i = 1; i <= n; i++) {
            fa[i] = i;
        }
    }
    int fifa(int x) {
        if (fa[x] == x) {
            return x;
        }
        return fa[x] = fifa(fa[x]);
    }
    void merge(int x, int y) {
        x = fifa(x);
        y = fifa(y);
        if (x != y) {
            fa[x] = y;
        }
    }
};

void solve() {
    int n, l, q;
    cin >> n >> l >> q;
    vector t(l + 1, vector(n + 1, 0));
    for (int i = 1; i <= l; i++) {
        string s;
        cin >> s;
        for (int j = 1; j <= n; j++) {
            int p1 = 2 * (j - 1);
            int p2 = 2 * (j - 1) + 1;
            t[i][j] = (s[p1] - 48) * 50 + (s[p2] - 48);
        }
    }

    // for (int i = 1; i <= l; i++) {
    //     for (int j = 1; j <= n; j++) {
    //         cout << t[i][j] << " \n"[j == n]; 
    //     }
    // }

    Dsu dsu;
    dsu.init(n);
    vector G(n + 1, vector<pii>());
    for (int i = 1; i <= l; i++) {
        int tot = 0;
        vector tong(n + 1, false);
        for (int j = 1; j <= n; j++) {
            if (!tong[t[i][j]]) {
                tot++;
            }
            tong[t[i][j]] = true;
        }

        if (tot <= n - 2) {
            continue;
        } else if (tot == n) {
            for (int j = 1; j <= n; j++) {
                int x = j, y = t[i][j];
                if (dsu.fifa(x) != dsu.fifa(y)) {
                    dsu.merge(x, y);
                    G[x].push_back({y, i});
                    G[y].push_back({x, i});
                }
            }
        } else {
            vector deg(n + 1, 0);
            vector lst(n + 1, 0);
            int x1 = -1, x2 = -1;
            for (int j = 1; j <= n; j++) {
                deg[t[i][j]]++;
                if (!lst[t[i][j]]) {
                    lst[t[i][j]] = j;
                } else {
                    x1 = lst[t[i][j]];
                    x2 = j;
                }
            }

            int y = -1;
            for (int j = 1; j <= n; j++) {
                if (deg[j] == 0) {
                    y = j;
                    break;
                }
            }

            G[x1].push_back({y, i});
            G[x2].push_back({y, i});
        }
    }

    vector dis(n + 1, vector(n + 1, INF));
    auto dij = [&](int s) -> void {
        dis[s][s] = 0;
        vector vis(n + 1, false);
        priority_queue<pii, vector<pii>, greater<pii>> pq;
        pq.push({0, s});
        while (!pq.empty()) {
            int u = pq.top().se;
            pq.pop();
            if (vis[u]) {
                continue;
            }
            vis[u] = true;
            for (auto [v, w] : G[u]) {
                if (dis[s][v] > max(dis[s][u], w)) {
                    dis[s][v] = max(dis[s][u], w);
                    pq.push({dis[s][v], v});
                }
            }
        }
    };
    for (int i = 1; i <= n; i++) {
        dij(i);
    }

    while (q--) {
        string s;
        cin >> s;
        int a = (s[0] - 48) * 50 + (s[1] - 48);
        int b = (s[2] - 48) * 50 + (s[3] - 48);
        int c = (s[4] - 48) * 50 + (s[5] - 48);
        // cout << a << " " << b << " " << c << '\n';
        // cout << "dis = "<< dis[a][b] << '\n';
        if (dis[a][b] <= c) {
            cout << 1;
        } else {
            cout << 0;
        }
    }
    cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}