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

#define ll long long
#define ull unsigned long long

int read()
{
    int x = 0; bool f = false; char c = getchar();
    while(c < '0' || c > '9') f |= (c == '-'), c = getchar();
    while(c >= '0' && c <= '9') x = (x << 1) + (x << 3) + (c & 15), c = getchar();
    return f ? -x : x;
}

const int inf = 0x7fffffff;
const int N = 4005;
int n, L, Q;
int vis[N];
char s[N];

int f[N];
int find(int x){ return (x == f[x]) ? (f[x]) : (f[x] = find(f[x])); }
void merge(int x, int y)
{
    x = find(x), y = find(y);
    if(x == y) return ;
    f[y] = x;
}

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

priority_queue< pair<int, int> > q;
int dis[2005][2005], Vis[2005];

void dijkstra(int S)
{
    for(int i = 1; i <= n; ++i) dis[S][i] = inf, Vis[i] = 0;
    dis[S][S] = 0;
    q.push(pair<int, int>(0, S));
    while(!q.empty())
    {
        int now = q.top().second ;
        q.pop();
        if(Vis[now]) continue;
        Vis[now] = 1;
        for(auto [v, w] : V[now])
        {
            if(dis[S][v] > max(dis[S][now], w))
            {
                dis[S][v] = max(dis[S][now], w);
                q.push(pair<int, int>(-dis[S][v], v));
            }
        }
    }
    // printf("S = %d\n", S);
    // for(int i = 1; i <= n; ++i) printf("%d ", dis[S][i]);
    // printf("\n");
}

void solve()
{
    n = read(), L = read(), Q = read();
    for(int i = 1; i <= n; ++i) f[i] = i, V[i].clear();
    for(int i = 1; i <= L; ++i)
    {
        for(int j = 1; j <= n; ++j) vis[j] = 0;
        int cnt = 0;
        scanf("%s", s + 1);
        for(int j = 1; j <= (n << 1); j += 2)
        {
            int id = (s[j] - 48) * 50 + (s[j + 1] - 48);
            if(!vis[id]) ++cnt, ++vis[id];
        }
        // printf("cnt = %d\n", cnt);
        if(cnt <= n - 2) continue;
        if(cnt == n)
        {
            for(int j = 1; j <= (n << 1); j += 2)
            {
                int id = (s[j] - 48) * 50 + (s[j + 1] - 48);
                if(find((j + 1) >> 1) == find(id)) continue;
                merge(find((j + 1) >> 1), find(id));
                // printf("双向边：u = %d, v = %d\n", (j + 1) >> 1, id);
                V[((j + 1) >> 1)].emplace_back(pair<int, int>(id, i));
                V[id].emplace_back(pair<int, int>(((j + 1) >> 1), i));
            }
        }else
        {
            int flag = 0;
            for(int j = 1; j <= n; ++j) if(vis[j] == 2){ flag = j; break; }
            for(int j = 1; j <= (n << 1); j += 2)
            {
                int id = (s[j] - 48) * 50 + (s[j + 1] - 48);
                if(flag == id)
                {
                    if(find(flag) == find((j + 1) >> 1)) continue;
                    // printf("单向边：u = %d, v = %d\n", (j + 1) >> 1, id);
                    V[(j + 1) >> 1].emplace_back(pair<int, int>(flag, i));
                }
            }
        }
    }

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

    while(Q--)
    {
        scanf("%s", s + 1);
        int a = (s[1] - 48) * 50 + (s[2] - 48), b = (s[3] - 48) * 50 + (s[4] - 48), c = (s[5] - 48) * 50 + (s[6] - 48);
        // printf("a = %d, b = %d, c = %d, dis = %d\n", a, b, c, dis[a][b]);
        if(dis[a][b] > c) printf("0");
        else printf("1");
    }
    printf("\n");
}

int main()
{
    int T = read();
    while(T--) solve();
    return 0;
}