#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lll __int128
#define ull unsigned long long
#define pb push_back
#define fo(i,j,k) for (int i = (j), end_i = (k); i <= end_i; i ++)
#define fd(i,j,k) for (int i = (j), end_i = (k); i >= end_i; i --)
#define ff(i,j,k) for (int i = (j), end_i = (k); i < end_i; i ++)
#define endl '\n'

template <class T>
inline void read(T &x) {
	x = 0;
	char ch = getchar();
	bool f = (ch == '-');
	for (;ch < '0' || ch > '9'; ) {
		ch = getchar();
		f |= (ch == '-');
	}
	for (;ch >= '0' && ch <= '9'; ch = getchar())
		x = (x * 10) + (ch - '0');
	if (f)
		x = -x;
}

template<class T, int N>
struct Bitset{
    const int B = sizeof(T) * 8; // 根据 T 的位数确定 B
    const T U = (B == 64) ? (-1ull) : ((1ull << B) - 1);
    T a[N];
    int n, m;

    void init(int _n) {
        n = _n;
        m = (n + B - 1) / B;
        for (int i = 0; i <= m; i ++)
            a[i] = 0;
    }

    Bitset(int _n = 0) {
        init(_n);
    }
    inline void _flush_last() {
        int tmp = ((n-1) % B + 1);
        a[m-1] &= (tmp == 64 ? 0ull : (1ull << tmp)) - 1;
    }

	int operator [] (int x) {
		return (a[x / B] >> (x % B)) & 1;
	}

    inline void reset(int pos = -1) {
        if (pos == -1) {
            for (int i = 0; i <= m; i ++)
                a[i] = 0;
        } else {
            a[pos / B] &= U ^ (1ull << (pos % B));
        }
    }
    inline void set(int pos = -1) {
        if (pos == -1) {
            for (int i = 0; i < m; i ++)
                a[i] = U;
            _flush_last();
        } else {
            a[pos / B] |= (1ull << (pos % B));
        }
    }
    inline void flip(int pos = -1) {
        if (pos == -1) {
            for (int i = 0; i < m; i ++)
                a[i] = U ^ a[i];
            _flush_last();
        } else {
            a[pos / B] ^= (1ull << (pos % B));
        }
    }
    friend Bitset operator & (const Bitset &a, const Bitset &b) {
        assert(a.n == b.n);
        Bitset c(a.n);
        for (int i = 0; i < a.m; i ++)
            c.a[i] = a.a[i] & b.a[i];
        return c;
    }
    friend Bitset operator | (const Bitset &a, const Bitset &b) {
        assert(a.n == b.n);
        Bitset c(a.n);
        for (int i = 0; i < a.m; i ++)
            c.a[i] = a.a[i] | b.a[i];
        return c;
    }
    friend Bitset operator ^ (const Bitset &a, const Bitset &b) {
        assert(a.n == b.n);
        Bitset c(a.n);
        for (int i = 0; i < a.m; i ++)
            c.a[i] = a.a[i] ^ b.a[i];
        return c;
    }
    Bitset operator = (const Bitset &b) {
        n = b.n;
        m = b.m;
        for (int i = 0; i <= m; i ++)
            a[i] = b.a[i];
        return *this;
    }

    Bitset operator << (int x) {
        assert(x >= 0);
        Bitset b(n);
        
        int t, l, r;
        t = (x / B);
        r = B * (t + 1) - x;
        l = B - r;
        if (l != B) {
            for (int i = 0; i < m - t; i ++)
                b.a[i + t] |= (a[i] << l) & U;
        }
        if (r != B) {
            for (int i = 0; i < m - t - 1; i ++)
                b.a[i + t + 1] |= (a[i] >> r);
        }
        b._flush_last();
        return b;
    }

    Bitset operator >> (int x) {
        assert(x >= 0);
        Bitset b(n);
        
        int t, l, r;
        t = (x / B);
        r = B * (t + 1) - x;
        l = B - r;
        if (l != B) {
            for (int i = 0; i + t < m; i ++)
                b.a[i] = (a[i + t] >> l);
        }
        if (r != B) {
            for (int i = 0; i < m - t - 1; i ++)
                b.a[i] |= (a[i + t + 1] << r);
        }
        b.a[m] = 0;
        b._flush_last();
        return b;
    }
	inline int _Find_first() {
		for (int i = 0; i < m; i ++)
			if (a[i])
				return i * B + __builtin_ctzll(a[i]);
		return n;
	}
	inline int _Find_next(int x) {
		int i = x / B, j = x % B;
		for ( ++j; j < B; j ++)
			if ((a[i] >> j) & 1)
				return i * B + j;
		for ( ++i; i < m; i ++)
			if (a[i])
				return i * B + __builtin_ctzll(a[i]);
		return n;
	}

    inline int count() {
        int ans = 0;
        for (int i = 0; i < m; i ++)
            ans += __builtin_popcountull(a[i]);
        return ans;
    }
    inline bool any() {
        for (int i = 0; i < m; i ++)
            if (a[i])
                return true;
        return false;
    }

    inline void print() {
        for (int i = 0; i < 32; i ++) {
            int x = (i / B), y = i % B;
            printf("%d", (a[x] >> y) & 1);
        }
        printf("\n");
    }
};

const int N = 2005, M = 1e6 + 5;

int n, l, q;
int t[N][N];
struct que{ int a, b, id; };
vector <que> vec[N];
int Ans[M];

int vis[N][N];
vector <int> fr[N];
Bitset <ull, N / 32> A[N], B[N], tmp[2];

char ch[N * 2];


inline void clear(){
	for(int i = 0; i <= l; ++i) vec[i].clear();
	fill(Ans, Ans + q + 1, 0);
	for(int i = 1; i <= n; ++i){
		fill(vis[i], vis[i] + n + 1, 0);
		A[i].reset(), B[i].reset();
	}
}

inline int decode(char a, char b){
	return (a - 48) * 50 + (b - 48);
}

int QAQ;

inline void Link(int x, int y){
	// cerr << x << ' ' << y << endl;
	if(vis[x][y]) return;
	vis[x][y] = 1;

	tmp[0] = B[x] ^ (B[x] & B[y]);
	tmp[1] = A[y] ^ (A[x] & A[y]);

	for(int p = tmp[0]._Find_first(); p != N; p = tmp[0]._Find_next(p)){
		++QAQ;
		A[p] = A[p] | A[y];
	}
	for(int p = tmp[1]._Find_first(); p != N; p = tmp[1]._Find_next(p)){
		B[p] = B[p] | B[x];
	}	
}
inline void Get(int *t){
	for(int i = 1; i <= n; ++i) fr[i].clear();
	for(int i = 1; i <= n; ++i){
		fr[t[i]].pb(i);
	}
	int two = 0, zero = 0, cnt = 0, mx = 0; 
	for(int i = 1; i <= n; ++i){
		int siz = fr[i].size();
		mx = max(mx, siz);
		if(siz == 2) two = i, ++cnt;
		if(siz == 0) zero = i;
	}
	if(mx > 2 || cnt > 1) return;

	if(two){
		int x = fr[two][0], y = fr[two][1];
		Link(x, zero);
		Link(y, zero);
	}else{
		for(int i = 1; i <= n; ++i) Link(i, t[i]);
	}
}

inline void ass(int x, int l, int r){
	assert(l <= x && x <= r);
}

inline void solve(){
	cin >> n >> l >> q;
	// cerr << n << ' ' << l << ' ' << q << endl;
	for(int i = 1; i <= l; ++i){
		cin >> ch;
		int nw = 0;
		for(int j = 1; j <= n; ++j){
			// cerr << nw << endl;
			t[i][j] = decode(ch[nw], ch[nw + 1]), nw += 2;
			// ass(t[i][j], 1, n);
		}
	}
	// return;
	for(int i = 1; i <= q; ++i){
		int a, b, c, nw = 0;
		// cerr << nw << endl;
		cin >> ch;
		a = decode(ch[nw], ch[nw + 1]), nw += 2;
		b = decode(ch[nw], ch[nw + 1]), nw += 2;
		c = decode(ch[nw], ch[nw + 1]), nw += 2;
		vec[c].pb({a, b, i});
		// cerr << a << ' ' << b << ' ' << c << endl;
		// ass(a, 1, n);
		// ass(b, 1, n);
		// ass(c, 0, l);
	}
	// cerr << "read end\n";

	// return;

	for(int i = 1; i <= n; ++i) A[i].set(i), B[i].set(i);

	for(int i = 0; i <= l; ++i){
		if(i) Get(t[i]);
		for(auto [a, b, id] : vec[i]){
			Ans[id] = A[a][b];
		}
	}

	for(int i = 1; i <= q; ++i) {
		cout << Ans[i];
		// cout << i << endl;
	}
	cout << endl;
	
}

int main() {
	for (int i = 0; i < N; i ++)
		A[i].init(N), B[i].init(N);
	tmp[0].init(N), tmp[1].init(N);

	// freopen("L.in", "r", stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);

	int Case = 0;
	cin >> Case;
	while(Case--) solve(), clear();

	// cerr << "all end\n";

	// cout << QAQ << endl;

	return 0;
}