#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

struct Edge{
    int u;
    int v;
    int w;
};

const int N = 2005;

int fa[N];

int find(int x){
    if(x == fa[x]) return x;
    return fa[x] = find(fa[x]);
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t;
    std::cin >> t;
    while(t--){
        int n, l, q;
        std::cin >> n >> l >> q;
        std::vector<Edge> e;
        fore(i, 1, n + 1) fa[i] = i;

        fore(w, 1, l + 1){
            std::string s;
            std::cin >> s;
            std::vector<int> in(n + 1);
            std::vector<int> to(n + 1);
            int cnt = 0;
            for(int i = 0; i < s.size(); i += 2){
                int u = i / 2 + 1, v = 50 * (s[i] - '0') + (s[i + 1] - '0');
                to[u] = v;
                if(!in[v]) ++cnt;
                ++in[v];
            }
            if(cnt <= n - 2) continue;
            if(cnt == n){
                fore(u, 1, n + 1){
                    int v = to[u];
                    int fau = find(u), fav = find(v);
                    if(fau == fav) continue;
                    e.push_back({u, v, w});
                    e.push_back({v, u, w});
                    fa[fau] = fav;
                }
            }
            else{
                int x0 = 0, y = 0;
                fore(i, 1, n + 1){
                    if(!in[i]) x0 = i;
                    else if(in[i] == 2) y = i;
                }
                fore(u, 1, n + 1)
                    if(to[u] == y)
                        e.push_back({u, x0, w});
            }
        }

        std::vector<std::vector<int>> f(n + 1, std::vector<int>(n + 1, l + 5));
        std::vector<std::vector<std::pair<int, int>>> g(n + 1);
        fore(i, 1, n + 1) f[i][i] = 0;
        

        fore(i, 1, n + 1){
            fore(u, 1, n + 1) g[u].clear();
            for(auto [u, v, w] : e){
                // std::cerr << u << ' ' << v << ' ' << w << endl;
                std::queue<int> q;
                g[u].push_back({v, w});
                if(f[i][v] > w && f[i][u] <= w){
                    f[i][v] = w;
                    q.push(v);
                }
                while(!q.empty()){
                    int u = q.front();
                    q.pop();
                    for(auto [v, _w] : g[u])
                        if(f[i][v] > w){
                            f[i][v] = w;
                            q.push(v);
                        }
                }
            }
        }

        while (q--){
            std::string s;
            std::cin >> s;
            std::array<int, 3> arr;
            for(int i = 0; i < s.size(); i += 2) arr[i / 2] = 50 * (s[i] - '0') + (s[i + 1] - '0');
            auto [a, b, c] = arr;
            std::cout << (f[a][b] <= c);
        }
        std::cout << endl;
    }
    
    return 0;
}