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

int T, n, l, q;
bitset<2005> g[2005];

int read() {
	char a, b; cin >> a >> b;
	return (a - '0') * 50 + (b - '0');
}

void init() {
	for (int i = 1; i <= n; i++) g[i].reset(), g[i].set(i);
}

void merge(int x, int y) {
	if (g[x][y]) return;
	for (int i = 1; i <= n; i++) if (g[i][x]) g[i] |= g[y];
}

void calc(vector<int> &v) {
	vector<int> vis(n + 1);
	int lst = 0;
	for (int i = 1; i <= n; i++) {
		if (!vis[v[i]]) vis[v[i]] = 1;
		else if (!lst) lst = v[i];
		else return;
	}
	if (!lst) for (int i = 1; i <= n; i++) merge(i, v[i]);
	else {
		int k = 0;
		for (int i = 1; i <= n; i++) if (!vis[i]) k = i;
		for (int i = 1; i <= n; i++) if (v[i] == lst) merge(i, k);
	}
}

struct opr {
	int id, x, y;
};

void work() {
	cin >> n >> l >> q; init();
	vector<vector<int> > to(l + 1, vector<int>(n + 1));
	vector<vector<opr> > qry(l + 1); vector<int> ans(q + 1);
	for (int i = 1; i <= l; i++) {
		for (int j = 1; j <= n; j++) to[i][j] = read();
	}
	for (int i = 1, x, y, id; i <= q; i++) {
		x = read(), y = read(), id = read();
		qry[id].push_back({i, x, y});
	}
	for (int i = 0; i <= l; i++) {
		calc(to[i]);
		for (opr p : qry[i]) {
			ans[p.id] = g[p.x][p.y];
		}
	}
	for (int i = 1; i <= q; i++) printf("%d", ans[i]); puts("");
}

int main() {
	cin >> T;
	while (T--) work();
	return 0;
}