#include<bits/stdc++.h>

#define N 2097
#define M 1000979
#define LL long long
#define pii pair<int, int> 
#define pll pair<LL, LL>
#define fi first
#define se second
#define pb push_back
#define lbd lower_bound
#define ubd upper_bound
#define IO ios :: sync_with_stdio(false), cin.tie(0)

using namespace std;

const LL INF = 1000000000;

int n, l, q, t[N][N], a[M], b[M], c[M], id[M], ans[M];
int cnt[N], dis[N][N];

string str; 

vector<pair<int, int>> g[N];

struct DSU {
    int f[N], n, sz[N];
    void init(int ln) {
        n = ln;
        for (int i = 1; i <= n; i ++) f[i] = i, sz[i] = 1;
        return;
    }
    int find(int v) {
        if (f[v] == v) return v;
        return f[v] = find(f[v]);
    }
    void merge(int x, int y) {
        x = find(x); y = find(y); 
        if (x == y) return;
        if (sz[x] < sz[y]) swap(x, y);
        f[y] = x;
        return;
    }
    bool check(int x, int y) {
        return find(x)  == find(y);
    }
} dsu;
void update(int ti) {
    for (int i = 1; i <= n; i ++) cnt[i] = 0;
    for (int i = 1; i <= n; i ++) cnt[t[ti][i]] ++;
    int cc = 0; 
    for (int i = 1; i <= n; i ++) if (cnt[i] > 0) cc ++;
    if (cc < n - 1) return;
    if (cc == n) { 
        for (int i = 1; i <= n; i ++) if (!dsu.check(i, t[ti][i])) {
            dsu.merge(i, t[ti][i]);
            g[i].pb({t[ti][i], ti});
            g[t[ti][i]].pb({i, ti});
        }
    } else {
        int v = 0, x = 0, y = 0; 
        for (int i = 1; i <= n; i ++) if (cnt[i] == 2) v = i; 
        for (int i = 1; i <= n; i ++) if (t[ti][i] == v) { 
            if (!x) x = i; 
            else y = i;
        }
        for (int i = 1; i <= n; i ++) if (!cnt[i]) v = i;
        g[x].pb({v, ti}); 
        g[y].pb({v, ti});
    }
    return;
}

priority_queue<pii, vector<pii>, greater<pii>> pq;
void Dij(int s) {
    while (!pq.empty()) pq.pop(); 
    for (int i = 1; i <= n; i ++) dis[s][i] = INF;
    dis[s][s] = 0; 
    pq.push({dis[s][s], s}); 
    while (!pq.empty()) {
        auto [d, u] = pq.top(); pq.pop(); 
        if (d > dis[s][u]) continue;
        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});
            }
        }
    }
    return;
}

void solve() {
    cin >> n >> l >> q;

    dsu.init(n);

    auto decode = [&] (string str) {
        vector<int> st; st.clear(); 
        for (int i = 0; i < (int) str.length(); i += 2) {
            auto c = str[i]; 
            auto h = str[i + 1];
            st.pb((c - 48) * 50 + h - 48);
        }
        return st;
    };

    for (int i = 1; i <= l; i ++) {
        cin >> str; 
        vector<int> tmp = decode(str); 
        for (int j = 1; j <= n; j ++) t[i][j] = tmp[j - 1];
        update(i);
    }

    for (int i = 1; i <= n; i ++) Dij(i);

    string pans; pans.clear();

    for (int i = 1; i <= q; i ++) {
        cin >> str; 
        vector<int> tmp = decode(str); 
        a[i] = tmp[0]; b[i] = tmp[1]; c[i] = tmp[2]; 
        if (dis[a[i]][b[i]] <= c[i]) pans.pb('1'); 
        else pans.pb('0');
    }

    cout << pans << "\n";    
    for (int i = 1; i <= n; i ++) 
        for (int j = 1; j <= n; j ++) dis[i][j] = 0;
    for (int i = 1; i <= n; i ++) g[i].clear();
}

int main() {
    IO;
    int T;
    cin >> T;
    while (T --) solve(); 
    return 0;
}