#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
using ll = long long;
#include <vector>
#include <numeric>

struct DSU {
	vector<int> p, siz;

	DSU() {}
	DSU(int n) {
		init(n);
	}

	void init(int n) {
		p.resize(n + 1);
		iota(p.begin(), p.end(), 0);
		siz.assign(n + 1, 1);
	}

	int find(int x) {
		while (x != p[x]) x = p[x] = p[p[x]]; // 路径压缩
		return x;
	}

	bool same(int x, int y) {
		return find(x) == find(y);
	}

	bool uno(int x, int y) {
		x = find(x), y = find(y);
		if (same(x, y)) return false;
		siz[x] += siz[y];
		p[y] = x;
		return true;
	}

	int size(int x) {
		return siz[find(x)];
	}
};

int read() {
	char u, v;
	cin >> u >> v;
	return (u - 48) * 50 + v - 48;
}

const int N = 2008;

void eachT() {
	int n, l, q;
	cin >> n >> l >> q;

	vector<vector<pair<int, int>>> E(n + 1);
	DSU dsu(n);
	for (int i = 1; i <= l; ++i) {
		vector<int> t(n + 1), cnt(n + 1);
		for (int j = 1; j <= n; ++j) {
			t[j] = read();
			cnt[t[j]] += 1;
		}
		int mul = -1, zero = -1, ok = 1;
		for (int j = 1; j <= n; ++j) {
			if (cnt[j] == 2) {
				if (mul == -1) mul = j;
				else ok = 0;
			}
			if (cnt[j] == 0) {
				if (zero == -1) zero = j;
				else ok = 0;
			}
		}
		if (!ok) continue;
		if (mul == -1) {
			for (int j = 1; j <= n; ++j) {
				if (dsu.uno(j, t[j])) {
					E[j].emplace_back(i, t[j]);
					E[t[j]].emplace_back(i, j);
				}
			}
		}
		else for (int j = 1; j <= n; ++j) {
			if (cnt[t[j]] == 2) {
				E[j].emplace_back(i, zero);
			}
		}
	}

	vector<vector<int>> ans(n + 1, vector<int>(n + 1));
	vector<queue<int>> Q(l + 1);
	for (int S = 1; S <= n; ++S) {
		vector<int> dis(n + 1, 1 << 30), vis(n + 1);
		dis[S] = 0;
		Q[0].push(S);
		for (int rd = 0; rd <= l; ++rd) {
			while (!Q[rd].empty()) {
				int u = Q[rd].front();
				Q[rd].pop();
				if (vis[u]) continue;
				vis[u] = 1;
				for (auto& [w, v] : E[u]) {
					if (dis[v] > max(dis[u], w)) {
						dis[v] = max(dis[u], w);
						Q[dis[v]].push(v);
					}
				}
			}
		}
		for (int i = 1; i <= n; ++i) ans[S][i] = dis[i];
	}
	for (int i = 0; i < q; ++i) {
		int a = read(), b = read(), c = read();
		if (ans[a][b] <= c) cout << '1';
		else cout << '0';
	}
	cout << '\n';
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int T = 1;
	cin >> T;

	while (T--) {
		eachT();
	}

	return 0;
}