#include "bits/stdc++.h"
using namespace std;

#define ll long long 
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353

#define pii pair<int, int>

#define N 2020


char buf[N<<2];

inline void decode(int* tar, int n) {
    for (int i = 0; i < n; ++ i) tar[i] = (buf[2*i] - 48) * 50 + (buf[2*i+1] - 48);
}


int f[N], t[N], vis[N], dis[N][N], qry[3];
vector<pii> G[N];
queue<int> buk[N];

void add_edge(int u, int v, int w) {
    G[u].emplace_back(v, w);
}

int find(int x) {
    return f[x] == x ? x : f[x] = find(f[x]);
}

void join(int x, int y) {
    f[find(x)] = f[y];
}


int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T; cin >> T;
    while (T --) {
        int n, l, q; cin >> n >> l >> q;
        
        for (int i = 1; i <= n; ++ i) {
            f[i] = i;
            G[i].clear();
        }

        for (int i = 1; i <= l; ++ i) {
            cin >> buf;
            decode(t+1, n);

            memset(vis+1, 0, n*sizeof(int));
            int unq = 0, x;
            for (int j = 1; j <= n; ++ j) if (++ vis[t[j]] == 1) ++ unq;
            for (int j = 1; j <= n; ++ j) if (!vis[j]) x = j;

            if (unq == n) {
                for (int j = 1; j <= n; ++ j) {
                    if (find(j) == find(t[j])) continue;
                    join(j, t[j]);
                    add_edge(j, t[j], i);
                    add_edge(t[j], j, i);
                }
            }
            if (unq == n-1) {
                for (int j = 1; j <= n; ++ j) {
                    if (vis[t[j]] != 2) continue;
                    add_edge(j, x, i);
                }
            }
        }
        
        for (int i = 1; i <= n; ++ i) {
            memset(vis+1, 0, n*sizeof(int));
            memset(dis[i]+1, 0x3f, n*sizeof(int));
            
            buk[0].push(i);
            for (int j = 0; j <= l; ++ j) {
                while (!buk[j].empty()) {
                    int u = buk[j].front(); buk[j].pop();
                    if (vis[u]) continue;

                    vis[u] = 1;
                    dis[i][u] = j;

                    for (auto [v, w] : G[u]) {
                        if (!vis[v]) {
                            buk[max(w, j)].push(v);
                        }
                    }
                }
            }
        }

        while (q --) {
            cin >> buf;
            decode(qry, 3);
            auto [a, b, c] = qry;
            cout << (dis[a][b] <= c);
        }
        cout << '\n';
    }
}