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

#define fopen                      \
    freopen("in.txt", "r", stdin); \
    freopen("out.txt", "w", stdout);
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)
#define i64 long long
#define pii pair<int, int>
#define de(x) cout << #x << " = " << x << '\n'

const int N = 2e3 + 10, M = 1e6 + 10, inf = 1e9 + 7;
const double eps = 1e-6;

int p[N], dis[N][N];
int ans[M], fa[N];
vector<pii> e[N];
int n, m, q;

int get(int x)
{
    return x == fa[x] ? x : fa[x] = get(fa[x]);
}

void solve()
{
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++)
    {
        fa[i] = i;
        e[i].clear();
        for (int j = 1; j <= n; j++)
            dis[i][j] = inf;
        e[i].clear();
    }

    for (int i = 1; i <= m; i++)
    {
        string s;
        cin >> s;
        vector<int> vis(n + 1, 0);
        int siz = n, same, left;
        for (int j = 1, x; j <= n; j++)
        {
            x = (s[j + j - 2] - 48) * 50 + (s[j + j - 1] - 48);
            p[j] = x;
            if (vis[x])
            {
                same = x;
                --siz;
            }
            vis[x] = 1;
        }
        if (siz == n)
        {
            for (int j = 1; j <= n; j++)
            {
                int fx = get(j), fy = get(p[j]);
                if (fx == fy)
                    continue;
                fa[fx] = fy;
                e[fx].push_back({fy, i});
                e[fy].push_back({fx, i});
            }
        }
        else if (siz == n - 1)
        {
            for (int j = 1; j <= n; j++)
                if (!vis[j])
                    left = j;
            for (int j = 1; j <= n; j++)
                if (p[j] == same)
                    e[j].push_back({left, i});
        }
    }

    for (int i = 1; i <= n; i++)
    {
        priority_queue<pii> q;
        q.push({0, i});
        vector<int> vis(n + 1, 0), d(n + 1, inf);
        d[i] = 0;
        while (!q.empty())
        {
            auto [dis, u] = q.top();
            q.pop();
            dis *= -1;
            if (vis[u])
                continue;
            vis[u] = 1;
            for (auto [v, w] : e[u])
                if (d[v] > max(w, d[u]))
                {
                    d[v] = max(w, d[u]);
                    q.push({-d[v], v});
                }
        }
        for (int j = 1; j <= n; j++)
            dis[i][j] = d[j];
    }

    for (int i = 1, a, b, c; i <= q; i++)
    {
        string s;
        cin >> s;
        a = (s[0] - 48) * 50 + s[1] - 48;
        b = (s[2] - 48) * 50 + s[3] - 48;
        c = (s[4] - 48) * 50 + s[5] - 48;
        ans[i] = dis[a][b] <= c;
    }
    for (int i = 1; i <= q; i++)
        cout << ans[i];
    cout << '\n';
}

signed main()
{
    // fopen;
    int t = 1;
    cin >> t;

    while (t--)
        solve();

    return 0;
}