#include <bits/stdc++.h>
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<int, int> pii;
typedef std::pair<LL, int> pli;
typedef std::pair<LL, LL> pll;
#define fi first
#define se second
#define MP std::make_pair
LL read() {
	LL s = 0; int f = 1;
	char c = getchar();
	while (!(c >= '0' && c <= '9'))
		f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9')
		s = s * 10 + (c ^ 48), c = getchar();
	return f ? s : -s;
} 
const LL LINF = 0x3f3f3f3f3f3f3f3fll;
const int N = 4007, MOD = 998244353, INF = 0x3f3f3f3f;
template<typename T> T& Fmax(T& x, T y) { return x = x < y ? y : x; };
template<typename T> T& Fmin(T& x, T y) { return x = x < y ? x : y; };
auto fplus = [](LL x, LL y) { return x + y < MOD ? x + y : x + y - MOD; };
auto fminus = [](LL x, LL y) { return x < y ? x - y + MOD : x - y; };
auto Fplus = [](LL &x, LL y) { x = fplus(x, y); };
auto Fminus = [](LL &x, LL y) { x = fminus(x, y); };

int rd() {
	char u, d; std::cin >> u >> d;
	return 50 * (u - 48) + (d - 48);
}

bool vis[N];
std::vector<pii> e[N];
std::vector<int> id[N], pos[N];
int n, l, q, p[N], dis[N][N];

struct DSU {
	int pr[N], siz[N];
	void init(int x) { for (int i = 1; i <= x; i ++) pr[i] = i, siz[i] = 1; }
	int fnd(int x) { return (pr[x] == x ? x : pr[x] = fnd(pr[x])); }
	bool uni(int x, int y) {
		int fx = fnd(x), fy = fnd(y); if (fx == fy) return false;
		if (siz[fx] < siz[fy]) std::swap(fx, fy); pr[fy] = fx, siz[fx] += siz[fy]; return true;
	}
} dsu;

void Dijkstra(int x) {
	for (int i = 1; i <= n; i ++) vis[i] = false;
	for (int i = 0; i <= l; i ++) id[i].clear();
	dis[x][x] = 0, id[0].push_back(x);
	for (int i = 0; i <= l; i ++)
		for (int j = 0; j < id[i].size(); j ++) {
			int u = id[i][j];
			if (vis[u]) continue; vis[u] = true;
			for (pii k : e[u])
				if (dis[x][k.fi] > std::max(i, k.se)) {
					dis[x][k.fi] = std::max(i, k.se);
					id[dis[x][k.fi]].push_back(k.fi);
				}
		}
}

void solve() {
	n = read(), l = read(), q = read(), dsu.init(n);
	for (int i = 1; i <= l; i ++) {
		for (int j = 1; j <= n; j ++) pos[j].clear();
		for (int j = 1; j <= n; j ++)
			pos[p[j] = rd()].push_back(j);
		int sum = 0, a, b;
		for (int j = 1; j <= n; j ++) {
			if (!pos[j].size()) sum ++, a = j;
			if (pos[j].size() == 2) b = j;
		}
		if (sum >= 2) continue;
		if (sum == 1) {
			e[pos[b][0]].push_back(MP(a, i));
			e[pos[b][1]].push_back(MP(a, i));
		} else {
			for (int j = 1; j <= n; j ++)
				if (dsu.uni(j, p[j])) {
					e[j].push_back(MP(p[j], i));
					e[p[j]].push_back(MP(j, i));
				}
		}
	}
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= n; j ++) dis[i][j] = INF;
	for (int i = 1; i <= n; i ++) Dijkstra(i);
	for (int i = 1, a, b, c; i <= q; i ++) {
		a = rd(), b = rd(), c = rd();
		std::cout << (dis[a][b] <= c);
	}
	for (int i = 1; i <= n; i ++) e[i].clear();
	puts("");
}

int main() {
	int tt = read();
	while (tt --) solve();
	return 0;
}