#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

inline int rdd() {
	char c = getchar();
	while (c < 48) c = getchar();
	return (c - 48) * 50 + getchar() - 48;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

#define N 2007
#define M 1000007

bool ans[M], vis[N];

int a[N], f[N], b[N][N];

vector<tii> Q[N];

vector<int> e[N], re[N], order;

int scc, bl[N];

int find(int x) {return x == f[x] ? x : f[x] = find(f[x]);}

void dfs1(int u) {
	vis[u] = true;
	for (auto v : e[u]) if (!vis[v]) dfs1(v);
	order.eb(u);
}

void dfs2(int u, int top) {
	bl[u] = scc;
	f[find(u)] = find(top);
	for (auto v : re[u]) if (!bl[v]) dfs2(v, top);
}

bitset<N> T[N];

inline void work() {
	int n = rd(), l = rd(), q = rd();
	rep(i, 0, n - 1) f[i] = i, bl[i] = 0;
	rep(i, 0, n) T[i].reset();
	rep(i, 0, l) Q[i].clear();

	rep(i, 0, l - 1) rep(j, 0, n - 1) b[i][j] = rdd() - 1;
	rep(i, 1, q) {
		int a = rdd(), b = rdd(), c = rdd();
		if (c == 0) ans[i] = (a == b);
		else Q[c - 1].eb(a - 1, b - 1, i);
	}

	vector<pii> E;

	auto rebuild = [&] () {
		scc = 0; order.clear();
		rep(i, 0, n - 1) {
			e[i].clear(); re[i].clear(); 
			vis[i] = false; bl[i] = 0;
		}
		for (auto [u, v] : E) {
			u = find(u);
			v = find(v);
			if (u == v) continue;
			e[u].eb(v); re[v].eb(u);
		}
		rep(u, 0, n - 1) if (u == find(u) && !vis[u]) dfs1(u);
		reverse(all(order));
		for (auto u : order) if (!bl[u]) {++scc; dfs2(u, u);}

		rep(i, 1, scc) re[i].clear();
		for (auto [u, v] : E) {
			u = find(u);
			v = find(v);
			if (u == v) continue;
			re[bl[v]].eb(bl[u]);
		}
		rep(i, 1, scc) {T[i].reset(); T[i][i] = true;}
		per(i, scc, 1) for (auto u : re[i]) T[u] |= T[i];
	};

	auto query = [&](int u, int v) {
		u = find(u); v = find(v);
		if (u == v) return true;
		return (T[bl[u]][bl[v]] == 1 ? true : false);
	};

	rep(i, 0, l - 1) {
		memset(vis, 0, sizeof(vis));
		int ept = -1, mul = -1, cnt = 0;
		rep(j, 0, n - 1) {
			a[j] = b[i][j];
			if (vis[a[j]]) mul = a[j];
			vis[a[j]] = true;
		}
		rep(j, 0, n - 1) if (!vis[j]) {++cnt; ept = j;}
		if (cnt <= 1) {
			if (cnt) {rep(j, 0, n - 1) if (a[j] == mul) E.eb(j, ept);}
			else {rep(j, 0, n - 1) f[find(j)] = find(a[j]);}
			rebuild();
		}		

		for (auto [a, b, id] : Q[i]) ans[id] = query(a, b);
	}
	rep(i, 1, q) putchar('0' + ans[i]);
}

int main() {
	per(t, rd(), 1) {work(); if (t > 1) puts("");}
	return 0;
}