#include <bits/stdc++.h>
#define LL unsigned long long
#define rep(i, s, e) for (int i = s; i <= e; i++)
using namespace std;
const int N = 2048;
int n, l, q, t[N][N];
struct node
{
    int a, b, no, ans;
    friend bool operator<(node x, node y)
    {
        return x.no < y.no;
    }
};
void qr(int &x)
{
    x = (getchar() - 48) * 50 + getchar() - 48;
}
struct BIT
{
    vector<LL> t;
    BIT()
    {
        t.resize(N >> 6);
    }
    bool operator[](size_t n)
    {
        int ind = n >> 6, bit = n & 63;
        return t[ind] >> bit & 1;
    }
    void set(size_t n, bool val)
    {
        int ind = n >> 6, bit = n & 63;
        t[ind] |= 1lu << bit;
    }
    BIT operator~()
    {
        BIT cpy = *this;
        for (int i = 0; i < N >> 6; i++)
        {
            cpy.t[i] = ~cpy.t[i];
        }
        return cpy;
    }
    void operator|=(const BIT &b)
    {
        for (int i = 0; i < N >> 6; i++)
        {
            t[i] |= b.t[i];
        }
    }
    void operator&=(const BIT &b)
    {
        for (int i = 0; i < N >> 6; i++)
        {
            t[i] &= b.t[i];
        }
    }
    int _Find_first()
    {
        int ind = 0;
        while (ind << 6 < N && !t[ind])
            ind++;
        if (ind < N)
            return ind << 6 | __builtin_ctzll(t[ind]);
        return N;
    }
    int _Find_next(int n)
    {
        int ind = n >> 6, bit = n & 63;
        int tmp = t[ind];
        tmp ^= 1lu << bit;
        tmp ^= tmp & ((1lu << bit) - 1);
        if (tmp)
        {
            return ind << 6 | __builtin_ctzll(tmp);
        }
        ind++;
        while (ind << 6 < N && !t[ind])
            ind++;
        if (ind < N)
            return ind << 6 | __builtin_ctzll(t[ind]);
        return N;
    }
};
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d%d\n", &n, &l, &q);
        rep(i, 1, l)
        {
            rep(j, 1, n)
            {
                qr(t[i][j]);
            }
            getchar();
        }
        BIT back[N], pre[N];
        rep(i, 1, n)
        {
            back[i].set(i, 1), pre[i].set(i, 1);
        }
        vector<node> v[N];
        rep(i, 1, q)
        {
            int a, b, c;
            qr(a), qr(b), qr(c), getchar();
            v[c].push_back({a, b, i});
        }
        for (auto &[a, B, _, ans] : v[0])
        {
            ans = back[a][B];
        }
        auto add = [&](int a, int b)
        {
            BIT newbacka = back[b], newpreb = pre[a];
            newbacka &= ~back[a], newpreb &= ~pre[b];
            for (int i = newbacka._Find_first(); i < N; i = newbacka._Find_next(i))
            {
                pre[i] |= pre[a];
            }
            for (int i = newpreb._Find_first(); i < N; i = newpreb._Find_next(i))
            {
                back[i] |= back[b];
            }
        };
        rep(i, 1, l)
        {
            int cnt[N] = {};
            rep(j, 1, n)
                cnt[t[i][j]]++;
            int c = 0, emp;
            rep(j, 1, n) c += !cnt[j];
            if (c <= 1)
            {
                if (!c)
                {
                    rep(j, 1, n)
                    {
                        add(j, t[i][j]);
                    }
                }
                else
                {
                    vector<int> C;
                    rep(j, 1, n)
                    {
                        if (!cnt[j])
                            emp = j;
                        if (cnt[t[i][j]] == 2)
                            C.push_back(j);
                    }
                    for (auto c : C)
                        add(c, emp);
                }
            }
            for (auto &[a, B, _, ans] : v[i])
            {
                ans = back[a][B];
            }
        }
        vector<node> all;
        rep(i, 0, l)
        {
            for (auto j : v[i])
                all.push_back(j);
        }
        sort(all.begin(), all.end());
        for (auto i : all)
        {
            putchar(i.ans + 48);
        }
        puts("");
    }
}