#include <bits/stdc++.h>
using namespace std;
const int N = 2005, M = 1e6 + 10;
int n, l, qu, cnt = 0, tot = 0;
vector <int> re[N], v[N], vg[N];
vector <pair <int, int> > jb[N];
int vis[N], b[N], dfn[N], low[N], fa[N], tp[N], Ans[M], cl[N];
bitset <N> as[N], pd[N], fg[N];
struct node{
    int a, b, v;
}qe[M];
stack <int> q;
queue <int> qh;

inline void read(int &x)
{
    char c = getchar();
    int w = 1;
    x = 0;
    while (!isdigit(c))
    {
        if (c == '-') w = -1;
        c = getchar();
    }
    while (isdigit(c))
    {
        x = x * 10 + (c ^ 48);
        c = getchar();   
    }
    x = x * w;
}

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

void prepare()
{
    for (int i = 1; i <= n; i++) 
    {
        jb[i].clear();
        vg[i].clear();
        v[i].clear();
        pd[i].reset();
        re[i].clear();
        fg[i].reset();
    }
    // for (int i = 1; i <= n; i++) pd[i].reset();
    read(n); read(l); read(qu);
    for (int ii = 1; ii <= l; ii++)
    {
        string s;
        cin >> s;
        
        for (int i = 1; i <= n; i++) 
        {
            vis[i] = b[i] = 0;
        }
        
        for (int i = 0; i < 2 * n; i += 2)
        {
            int x = (s[i] - '0') * 50 + (s[i + 1] - '0');
            int t = i / 2 + 1;
            vis[x] ++;
            b[t] = x;
            // re[i].push_back(x);
        }
        int p1 = 0, p2 = 0, multi = 0, zero = 0;
        for (int i = 1; i <= n; i++)
        {
            if (vis[i] > 1)
            {
                p1 += vis[i] - 1;
                multi = i;
            }
            if (vis[i] == 0) 
            {
                p2++;
                zero = i;
            }
            if (p1 > 1 || p2 > 1) break;
        }
        // cout <<ii << "    " << p1 << " " << p2 << endl;
        if (p1 > 1 || p2 > 1) continue;
        for (int i = 1; i <= n; i++)
        {
            if (p1 == 0) jb[ii].push_back({i, b[i]});
            else 
            {
                if (vis[b[i]] == 2) jb[ii].push_back({i, zero});
            }
        }
        // if (p2) jb[ii].push_back({multi, zero});
    }
    for (int i = 1; i <= qu; i++)
    {
        Ans[i] = 0;
        string s;
        cin >> s;
        qe[i].a = (s[0] - '0') * 50 + (s[1] - '0');
        qe[i].b = (s[2] - '0') * 50 + (s[3] - '0');
        qe[i].v = (s[4] - '0') * 50 + (s[5] - '0');
        re[qe[i].v].push_back(i);
        // cout << "   " << i << " " << qe[i].a << " " << qe[i].b << " " << qe[i].v << endl;
        if (qe[i].a == qe[i].b) Ans[i] = 1;
        else Ans[i] = 0;
    }
    // cout << "!!" << endl;

}

void dfs(int x)
{
    cnt++;
    low[x] = dfn[x] = cnt;
    q.push(x);
    for (int i = 0; i < v[x].size(); i++)
    {
        int y = v[x][i];
        // cout << x << " ^^  " << y << " " << endl;
        if (!dfn[y])
        {
            dfs(y);
            low[x] = min(low[x], low[y]);
        }
        else if (!cl[y]) low[x] = min(low[x], dfn[y]);
    }
    // cout << "   " << x <<  " " << low[x] << " " << dfn[x] << endl;
    if (low[x] == dfn[x])
    {
        tot++;
        // cout << "tarjan   " << x << " " << tot << " :" << endl;
        while (!q.empty())
        {
            int t = q.top();
            q.pop();
            cl[t] = x;
            // cout << "!!  " <<  t << endl;
            if (t == x) break;
        }
    }
}

void perform()
{
    for (int i = 1; i <= n; i++) fa[i] = i;
    for (int i = 1; i <= l; i++)
    {   
        // cout << i << "  : " << endl;
        for (int j = 0; j < jb[i].size(); j++)
        {
            int x = find(jb[i][j].first), y = find(jb[i][j].second);
            if (x == y) continue;
            if (!pd[x][y]) v[x].push_back(y), pd[x][y] = true;
            // cout << "jb  " << x << " " << y << endl;
        }
        for (int j = 1; j <= n; j++)
        {
            dfn[j] = low[j] = 0;
            tp[j] = cl[j] = 0;
        }
        tot = 0;
        cnt = 0;
        while (!qh.empty()) qh.pop();
        while (!q.empty()) q.pop();
        for (int j = 1; j <= n; j++)
        {

            if (!dfn[j]) dfs(j);
        }        
        for (int j = 1; j <= n; j++)
        {
            // as[j].reset();
            fg[j].reset();
            as[j][j] = 1;
            if (tp[j] == 0) qh.push(j);
            vg[j].clear();
        }
        // cout << " !!" << endl; 
        // cout << endl;
        // cout << i << " :  " << endl;
        for (int j = 1; j <= n; j++)
        {
            fa[j] = find(cl[j]);
            // if (i == 4 )cout << j << " " << fa[j]  << " " << cl[j]<< " " << endl;
            for (int k = 0; k < v[j].size(); k++)
            {
                int y = v[j][k];
                int h1 = cl[j], h2 = cl[y];
                if (h1 == h2) continue;
                // if (i == 4 ) cout << "  jb  " << j << " " << y << " " << h1 << " " << h2 << endl;
                if (!fg[h1][h2]) vg[h1].push_back(h2), fg[h1][h2] = true;
                tp[h2]++;
            }
        }
        int df = 0;
        while (!qh.empty())
        {
            int x = qh.front();
            qh.pop();
            // df++;
            // if (df > n * 2) break;
            for (int j = 0; j < vg[x].size(); j++)
            {
                int y = vg[x][j];

                tp[y]--;
                as[y] |= as[x];
                if (tp[y] == 0) qh.push(y);
            }
        }
        // cout << i << "   ***" << endl;
        // for (int j = 1; j <= n; j++)
        // {
        //     for (int k = 1; k <= n; k++)
        //     {
        //         cout << "As  " << i << " " << j << " " << k << " " << as[k][j] << endl;
        //     }
        // }
        for (int j = 0; j < re[i].size(); j++)
        {
            int x = re[i][j];
            
            int t1 = find(qe[x].a), t2 = find(qe[x].b);
            // cout << j << "  ??  " << t1 << " " << t2 << " " << x << endl;
            if (as[t2][t1] ||t2 == t1) Ans[x] = 1;
            else Ans[x] = 0; 
        }
    }
}


int main()
{
    
    int T;
    read(T);
    while (T > 0)
    {
        T--;
        prepare();
        perform();
        for (int i = 1; i <= qu; i++)
        {
            cout << Ans[i];
        }
        cout << endl;
    }
    return 0;
}
/*
2
5 2 4
0305040201
0404040404
030300
020500
050102
020501
6 2 4
030603010601
010203060504
030202
060402
050602
060401

1011
0100

1
3 3 6
020202
030301
030201
020102
030203
010201
010303
020303
010202

010101


1
8 11 15
0703040502060802
0502060308010404
0202020204050602
0202040703050201
0706020504030801
0402050607070103
0303050206040708
0406050707010203
0403020108060507
0303020607080501
0705030402060801
020401
030507
060204
080506
020704
050806
070809
040503
070405
060802
080308
040506
050103
060104
060705
 


*/