#include <bits/stdc++.h>
#define int long long 
#define endl '\n'
using namespace std;
void solve() {
	int n, l, q;
	cin >> n >> l >> q;
	getchar();
	vector<vector<int>>z(n + 2, vector<int>(n + 2, 0x3f3f3f3f));
	vector<vector<int>>w(n + 2, vector<int>(n + 2, 0));
	vector<vector<pair<int,int>>>zzz(n + 2, vector<pair<int,int>>(0));
	for (int i = 1; i <= n; i++) {
		w[i][i] = 1;
	}
	for (int i = 1; i <= l; i++) {
		vector<int>cur(n + 2);
		vector<int>du(n + 2);
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= 2; k++) {
				cur[j] *= 50;
				char a = getchar();
				cur[j] += a - '0';
			}
		}
		getchar();
		for (int k = 1; k <= n; k++) {
			du[cur[k]]++;
		}
		int flag1 = 0, flag2 = 0;
		for (int k = 1; k <= n; k++) {
			if (du[k] != 1) {
				flag1++;
			}
			if (du[k] == 0) {
				flag2 = k;
			}
		}
		if (flag1 == 0) {
			for (int k = 1; k <= n; k++) {
				if (w[k][cur[k]]) {
					continue;
				}
				zzz[k].push_back({ -i, cur[k] });
				w[k][cur[k]] = 1;
			}
		}
		else {
			if (flag1 == 2) {
				for (int k = 1; k <= n; k++) {
					if (du[cur[k]] == 2 && w[k][flag2]==0) {
						zzz[k].push_back({ -i, flag2 });
						w[k][flag2] = 1;
					}
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		vector<int>vis(n + 2, 0);
		priority_queue<pair<int, int>> qqq;
		qqq.push({ 0, i });
		while (!qqq.empty()) {
			pair<int, int> u = qqq.top();
			qqq.pop();
			if (vis[u.second] == 1)
				continue;
			z[i][u.second] = -u.first;
			vis[u.second] = 1;
			for (auto ed : zzz[u.second]) {
				int www = ed.first, v = ed.second;
				if (vis[v] == 1)
					continue;
				qqq.push({ -max(z[i][u.second],-www), v });
			}
		}
	}
	for (int i = 1; i <= q; i++) {
		int u = 0;
		for (int k = 1; k <= 2; k++) {
			u *= 50;
			char a = getchar();
			u += a - '0';
		}
		int v = 0;
		for (int k = 1; k <= 2; k++) {
			v *= 50;
			char a = getchar();
			v += a - '0';
		}
		int w = 0;
		for (int k = 1; k <= 2; k++) {
			w *= 50;
			char a = getchar();
			w += a - '0';
		}
		getchar();
		if (z[u][v] <= w) {
			putchar('1');
		}
		else {
			putchar('0');
		}
	}
	putchar('\n');
}
signed main() {
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}