#include <bits/stdc++.h>
#include<array>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//#define int long long
#define lowbit(x) ((x) & (-x))
#define ar(x) array<int, x>
#define endl '\n'
#define all(x)  begin(x),end(x)
#define all2(x)  begin(x)+1,end(x)
using namespace std;
using i64 = long long;
const int N = 2e5 + 10;
const int M = 5e5 + 1;
const int INF = 0x3f3f3f3f;
const ll INF2 = 0x3f3f3f3f3f3f3f3f;
const long double PI = 3.1415926535897932384626;
const long double eps = 1e-5;
const ll mod = 19260817;
const ll mod2 = 998244353;
const int base = 131;
const int base2 = 13331;
int dx[] = { 1,-1,0,0 }, dy[] = { 0,0,1,-1 };
int dx2[] = { 2,-2,0,0 }, dy2[] = { 0,0,2,-2 };
ll qpow(ll a, ll b, ll p)
{
    ll ans = 1;
    while (b)
    {
        if (b & 1)
            ans *= a, ans %= p;
        a *= a;
        a %= p;
        b >>= 1;
    }
    return ans % p;
}
ll gcd(ll a, ll b)
{
    return !b ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
    return a / gcd(a, b) * b;
}
int n, m;
//tim为时间
int dfn[N], low[N], tim = 0, vis[N], cnt = 0, top = 0;//dfn标记dfs遍历的顺序，low标记当前点通过某条边所能回溯到的最早的那个点，vis标记当前点是否在栈内
vector<int>g[2020];//邻接表存图和缩点后的图
int s[N];//栈
int scc[N];//缩点后原点属于缩点后的哪个点
void dfs(int x)
{
    s[++top] = x;
    vis[x] = true;//标记为在栈内
    dfn[x] = low[x] = ++tim;//时间入和出的初标记
    for (int i = 0; i < g[x].size(); ++i)
    {
        int y = g[x][i];
        if (dfn[y] == 0)//如果当前点没被遍历
        {
            dfs(y);//遍历当前当前点
            low[x] = min(low[x], low[y]);//更新low
        }
        else if (vis[y] == true)//如果当前点在栈内则更新low
        {
            low[x] = min(low[x], low[y]);
        }
        //如果不在栈内则不用管
    }
    if (dfn[x] == low[x])//如果当前二者相等
    {
        int t;
        ++cnt;
        do {
            t = s[top--];
            vis[t] = 0;
            scc[t] = cnt;
        } while (t != x);
    }
}
void tarjan()
{
    for (int i = 1; i <= n; ++i)//循环dfs，因为可能不连通
    {
        if (dfn[i] == 0)
            dfs(i);
    }
}
void init()
{
    top = tim = cnt = 0;
    for (int i = 1; i <= n; ++i)
    {
        g[i].clear();
        dfn[i] = scc[i] = low[i] = vis[i] = 0;
    }
}
void solve() {
    int n, l, q;
    cin >> n >> l >> q;

    vector g(n + 1, std::bitset<2005>());
    for (int i = 1; i <= n; i++) g[i][i] = 1;

    vector t(l + 1, vector<int>(n + 1));
    for (int i = 1; i <= l; i++) {
        string s;
        cin >> s;
        for (int j = 1; j <= n; j++) {
            
            t[i][j] = (s[2 * j - 2] - 48) * 50 + (s[2 * j - 1] - 48);
        }
    }

    vector<int> ans(q);
    vector qry(l + 1, vector<std::array<int, 3>>());
    for (int i = 0; i < q; i++) {
        string s;
        cin >> s;
        int a, b, c;
        a = (s[0] - 48) * 50 + (s[1] - 48);
        b = (s[2] - 48) * 50 + (s[3] - 48);
        c = (s[4] - 48) * 50 + (s[5] - 48);
        qry[c].push_back({ a, b, i });
    }

    auto add = [&](int a, int b) {
        if (g[a][b]) return;

        for (int i = 1; i <= n; i++) {
            if (g[i][a]) {
                g[i] |= g[b];
            }
        }
    };

    auto go = [&](const auto& p) {
        vector<int> buk(n + 1);
        int f = 0;
        for (int i = 1; i <= n; i++) {
            if (!buk[p[i]]) buk[p[i]] = 1;
            else if (f) return;
            else f = p[i];
        }

        if (!f) {
            for (int i = 1; i <= n; i++) {
                add(i, p[i]);
            }
        }
        else {
            int x = 0;
            for (int i = 1; i <= n; i++) {
                if (!buk[i]) x = i;
            }

            for (int i = 1; i <= n; i++) {
                if (p[i] == f) {
                    add(i, x);
                }
            }
        }
    };

    for (int i = 0; i <= l; i++) {
        go(t[i]);

        for (auto [a, b, idx] : qry[i]) {
            ans[idx] = g[a][b];
        }
    }

    for (int x : ans) cout << x;
    cout << endl;
}
/*
400
5 5 100
0405020501
0404050302
0105050105
0304010205
0402030205
*/
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}