#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define ll long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define fi first
#define pll pair<ll, ll>
#define se second
#define lll __int128
#define ld long double
#define all(a) a.begin() + 1, a.end()
#define iofast                   \
    ios::sync_with_stdio(false); \
    cin.tie(0), cout.tie(0)
#define lowbit(i) (i & (-i))
using namespace std;
const int maxn = 1e6 + 5, mod = 1000000007;
void solve()
{
    int n, l, q;
    cin >> n >> l >> q;
    vector tong(l + 1, vector<pii>());
    for (int i = 1; i <= l; i++)
    {
        string s;
        cin >> s;
        vector<int> in(n + 1);
        int cnt = n;
        int zhuang = 0;
        for (int j = 0, id = 1; j < s.length(); j += 2, id++)
        {
            auto x = (s[j] - '0') * 50 + s[j + 1] - '0';
            cnt -= !in[x]++;
            tong[i].push_back(pair{id, x});
            if (in[x] == 2)
                zhuang = x;
            else if (in[x] == 3)
                zhuang = -1;
        }
        if (cnt == 0)
        {
            continue;
        }
        else if (cnt == 1 && ~zhuang)
        {
            auto yuan = -1;
            for (int j = 1; j <= n; j++)
            {
                yuan = !in[j] ? j : yuan;
            }
            vector<pii> tmp;
            for (auto [j, k] : tong[i])
            {
                if (in[k] == 2)
                {
                    tmp.push_back(pair{j, yuan});
                }
            }
            tmp.swap(tong[i]);
        }
        else
            tong[i].clear();
    }
    vector qry(l + 1, vector<array<int, 3>>());
    for (int i = 1; i <= q; i++)
    {
        string s;
        cin >> s;
        auto a = (s[0] - '0') * 50 + s[1] - '0';
        auto b = (s[2] - '0') * 50 + s[3] - '0';
        auto c = (s[4] - '0') * 50 + s[5] - '0';
        qry[c].push_back(array{a, b, i});
    }
    vector<bitset<2002>> in(n + 1), out(n + 1);
    for (int i = 1; i <= n; i++)
    {
        in[i][i] = 1;
        out[i][i] = 1;
    }
    string ans = string(q + 1, '0');
    rep(i, 0, l)
    {
        for (auto [u, v] : tong[i])
        {
            if (out[u][v])
                continue;
            for (int j = 1; j <= n; j++)
            {
                if (in[u][j])
                {
                    out[j] |= out[v];
                }
            }
        }
        for (auto [a, b, id] : qry[i])
        {
            ans[id] = out[a][b] ? '1' : '0';
        }
    }
    cout << ans.substr(1, q) << "\n";
}
int main()
{
    iofast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    // cout << endl;
    //  system("pause");
}