#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define pii pair<int, int>
#define pll pair<LL, LL>
#define fi first
#define se second
#define mkp make_pair
#define sz(x) (int)x.size()
using namespace std;
bool Mst;

LL read() {
	LL s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

int encode() {
	char ch = getchar();
	while (ch < 48) ch = getchar();
	return (ch - '0') * 50 + (getchar() - '0');
}

const int MAXN = 2005;

int n, l, q;
int t[MAXN], cnt[MAXN];
bool vis[MAXN];
vector<pii> e[MAXN];
int dis[MAXN][MAXN];

namespace DSU {
	int fa[MAXN];
	void init() { for (int i = 1; i <= n; i++) fa[i] = i;}
	int get(int x) {return x == fa[x] ? x : fa[x] = get(fa[x]);}
	bool merge(int x, int y) {
		int fx = get(x), fy = get(y);
		if (fx == fy) return false;
		return fa[fx] = fy, true;
	}
}

void add(int u, int v, int w) {
	// cout << u << ' ' << v << ' ' << w << endl;
	e[u].push_back(mkp(v, w));
}

void work() {
	n = read(), l = read(), q = read();
	for (int i = 1; i <= n; i++) e[i].clear();
	DSU::init();
	for (int id = 1; id <= l; id++) {
		for (int i = 1; i <= n; i++) cnt[i] = 0;
		for (int i = 1; i <= n; i++) t[i] = encode(), cnt[t[i]]++;
		int c = 0, p = 0;
		for (int i = 1; i <= n; i++)
			if (!cnt[i]) p = i, c++;
		if (c > 1) continue;
		if (!c) {
			for (int i = 1; i <= n; i++) vis[i] = 0;
			for (int i = 1; i <= n; i++) {
				if (vis[i]) continue;
				vector<int> p;
				int u = i;
				while (!vis[u]) vis[u] = 1, p.push_back(u), u = t[u];
				for (int x : p) if (DSU::merge(i, x)) add(x, i, id), add(i, x, id);
			}
		}
		else for (int i = 1; i <= n; i++) if (cnt[t[i]] > 1) add(i, p, id);
	}
	for (int i = 1; i <= n; i++) {
		priority_queue<pii, vector<pii>, greater<pii> > pq;
		for (int j = 1; j <= n; j++)
			dis[i][j] = 1e9, vis[j] = 0;
		dis[i][i] = 0, pq.push(mkp(0, i));
		while (!pq.empty()) {
			pii x = pq.top();
			pq.pop();
			if (vis[x.se]) continue;
			vis[x.se] = 1;
			for (pii y : e[x.se])
				if (dis[i][y.fi] > max(x.fi, y.se))
					pq.push(mkp(dis[i][y.fi] = max(x.fi, y.se), y.fi));
		}
	}
	while (q--) {
		int a = encode(), b = encode(), c = encode();
		putchar((dis[a][b] <= c) + '0');
	}
	putchar('\n');
}

bool Med;
signed main() {
	int T = read();
	while (T--)
		work();
	return 0;
}