#include<bits/stdc++.h>
#define ri int
#define N 2050
#define LL long long
using namespace std;

int T, n, l, q, p[N][N], cnt[N], bad[N];
char s[N * 2];
bool ans[1000050];

int trans(char a, char b) {
	a -= 48; b -= 48;
	return a * 50 + b;
}

struct query {
	int a, b, id;
};
vector<query> Q[N];


struct Graph {
	int dfn[N], low[N], ccc;
	int u[N * N], v[N * N], bel[N], ins[N], ru[N], clock, cnt_edge;
	set<int> abo[N], ab1[N];
	vector<int> to[N];
	bitset<N> f[N];
	stack<int> s;

	void clear() {
		for (ri i = 1; i <= n; i++) to[i].clear();
		for (ri i = 1; i <= n; i++) abo[i].clear(), ab1[i].clear();
		for (ri i = 1; i <= n; i++) ins[i] = 0;
		ccc = 0; cnt_edge = 0;
		while (!s.empty()) s.pop();
	}

	void add_edge(int a, int b) {
		if (!ab1[a].count(b)) {
			//printf("add edge(%d, %d)\n", a, b);
			ab1[a].insert(b);
			to[a].push_back(b);
			++cnt_edge;
			u[cnt_edge] = a;
			v[cnt_edge] = b;
		}
	}

	void tarjan(int x) {
		low[x] = dfn[x] = ++clock;
		s.push(x);
		ins[x] = 1;
		int i, l = to[x].size(), t;
		for (i = 0; i < l; i++) {
			if (ins[to[x][i]]) low[x] = min(low[x], dfn[to[x][i]]);
			else {
				if (dfn[to[x][i]] == 0) {
					tarjan(to[x][i]);
					low[x] = min(low[x], low[to[x][i]]);
				}
			}
		}
		if (dfn[x] == low[x]) {
			do {
				t = s.top();
				bel[t] = x;
				ins[t] = false;
				s.pop();
				if (t == x) break;
			} while (1);
		}
		return;
	}

	void dp(int x) {
		for (auto it = abo[x].begin(); it != abo[x].end(); it++) {
			int y = *it;
			dp(y);
			f[x] |= f[y];
		}
	}

	void init() {
		clock = 0;
		for (ri i = 1; i <= n; i++) dfn[i] = low[i] = 0;
		for (ri i = 1; i <= n; i++) if (!dfn[i]) tarjan(i);
		for (ri i = 1; i <= n; i++) f[bel[i]] = 0;
		for (ri i = 1; i <= n; i++) f[bel[i]][i] = 1;
		for (ri i = 1; i <= n; i++) ru[i] = 0;
		for (ri i = 1; i <= cnt_edge; i++) {
			int uu = bel[u[i]], vv = bel[v[i]];
			if (uu != vv && !abo[uu].count(vv)) abo[uu].insert(vv), ru[vv]++;
		}
		for (ri i = 1; i <= n; i++) if (!ru[bel[i]]) {
			dp(bel[i]);
			ru[bel[i]] = -1;
		}
	}
} G;

int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d%d", &n, &l, &q);
		for (ri i = 1; i <= l; i++) bad[i] = 0;
		for (ri i = 1; i <= q; i++) ans[i] = 0;
		for (ri i = 1; i <= n; i++) cnt[i] = 0;
		for (ri i = 1; i <= l; i++) {
			scanf("%s", s + 1);
			for (ri j = 1, cc = 0; j <= 2 * n; j += 2) {
				p[i][++cc] = trans(s[j], s[j + 1]);
			}
			for (ri j = 1; j <= n; j++) cnt[j] = 0;
			for (ri j = 1; j <= n; j++) cnt[p[i][j]]++;
			int cc = 0;
			for (ri j = 1; j <= n; j++) {
				if (cnt[j] > 2) bad[i] = 1;
				else if (cnt[j] == 2) cc++;
			}
			if (cc >= 2) bad[i] = 1;
			else if (cc == 1) {
				int x = -1, y = -1;
				for (ri j = 1; j <= n; j++) if (cnt[p[i][j]] == 2) {
					if (x == -1) x = j; else y = j;
				}
				else {
					p[i][j] = -1;
				}
				int wu;
				for (ri j = 1; j <= n; j++) if (cnt[j] == 0) wu = j;
				p[i][x] = wu; p[i][y] = wu;
			}
		}
		for (ri i = 1; i <= q; i++) {
			scanf("%s", s + 1);
			int qa = trans(s[1], s[2]);
			int qb = trans(s[3], s[4]);
			int qc = trans(s[5], s[6]);
			Q[qc].push_back((query){qa, qb, i});
		}
		for (ri i = 0; i <= l; i++) {
			G.clear();
			for (ri j = 1; j <= i; j++) if (!bad[j]) {
				for (ri t = 1; t <= n; t++) if (t != p[j][t] && p[j][t] != -1) G.add_edge(t, p[j][t]);
			}
			G.init();
			for (auto it = Q[i].begin(); it != Q[i].end(); ++it) {
				ans[it->id] = G.f[G.bel[it->a]][G.bel[it->b]];
			}
			//puts("");
		}
		//printf(">>>");
		for (ri i = 1; i <= q; i++) printf("%d", ans[i]);
		puts("");
	}
	return 0;
}