#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];
	int bel[N], ins[N], ru[N], clock;
	vector<int> to1[N], to2[N], vec;
	bitset<N> f[N];
	stack<int> s;

	void first_init() {
		for (ri i = 1; i <= n; i++) {
			to2[i].clear();
			ins[i] = ru[i] = dfn[i] = low[i] = 0;
		}
		vec.clear();
		for (ri i = 1; i <= n; i++) vec.push_back(i);
		for (ri i = 1; i <= n; i++) bel[i] = i;
	}
	
	int findroot(int x) {
		if (bel[x] == x) return x;
		return bel[x] = findroot(bel[x]);
	}

	void add_edge(int a, int b) {
		if (bel[a] != bel[b]) to2[bel[a]].push_back(bel[b]);
	}

	void tarjan(int x) {
		low[x] = dfn[x] = ++clock;
		s.push(x);
		ins[x] = 1;
		int i, l = to1[x].size(), t;
		for (i = 0; i < l; i++) {
			if (ins[to1[x][i]]) low[x] = min(low[x], dfn[to1[x][i]]);
			else {
				if (dfn[to1[x][i]] == 0) {
					tarjan(to1[x][i]);
					low[x] = min(low[x], low[to1[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 init() {
		for (auto it = vec.begin(); it != vec.end(); it++) {
			ins[*it] = dfn[*it] = low[*it] = 0;
			sort(to2[*it].begin(), to2[*it].end());
			to2[*it].resize(unique(to2[*it].begin(), to2[*it].end()) - to2[*it].begin());
			to1[*it] = to2[*it];
			to2[*it].resize(0);
		}
		clock = 0; while (!s.empty()) s.pop();
		for (auto it = vec.begin(); it != vec.end(); it++) if (!dfn[*it]) tarjan(*it);
		for (ri i = 1; i <= n; i++) bel[i] = findroot(i);
		vector<int> vec2; vec2.clear();
		for (auto it = vec.begin(); it != vec.end(); it++) if (*it == bel[*it]) vec2.push_back(*it);
		swap(vec, vec2);
		for (auto it = vec.begin(); it != vec.end(); it++) f[*it] = 0, ru[*it] = 0;
		for (auto it = vec.begin(); it != vec.end(); it++) f[*it][*it] = 1;
		for (auto it = vec2.begin(); it != vec2.end(); it++) {
			for (auto it2 = to1[*it].begin(); it2 != to1[*it].end(); ++it2) if (bel[*it] != bel[*it2]) {
				to2[bel[*it]].push_back(bel[*it2]);
				ru[bel[*it2]]++;
			}
		}
		for (auto it = vec.begin(); it != vec.end(); it++) {
			sort(to2[*it].begin(), to2[*it].end());
			to2[*it].resize(unique(to2[*it].begin(), to2[*it].end()) - to2[*it].begin());
		}

		queue<int> q; stack<int> s;
		while (!q.empty()) q.pop();
		while (!s.empty()) s.pop();
		for (auto it = vec.begin(); it != vec.end(); it++) if (!ru[*it]) q.push(*it), s.push(*it);
		while (!q.empty()) {
			int x = q.front(); q.pop();
			for (auto y : to2[x]) {
				ru[y]--;
				if (!ru[y]) q.push(y), s.push(y);
			}
		}
		while (!s.empty()) {
			int x = s.top(); s.pop();
			for (auto y : to2[x]) f[x] |= f[y];
		}
	}
} 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 = 0; i <= l; i++) Q[i].clear();
		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});
		}
		G.first_init();
		for (ri i = 0, first = 1; i <= l; i++) {
			if (i && !bad[i]) {
				for (ri t = 1; t <= n; t++) if (t != p[i][t] && p[i][t] != -1) G.add_edge(t, p[i][t]);
				G.init();
				first = 0;
			}
			for (auto it = Q[i].begin(); it != Q[i].end(); ++it) {
				if (first) ans[it->id] = (it->a == it->b); else ans[it->id] = G.f[G.bel[it->a]][G.bel[it->b]];
			}
		}
		for (ri i = 1; i <= q; i++) printf("%d", ans[i]);
		puts("");
	}
	return 0;
}