#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fi first
#define se second
#define mp make_pair

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
	int f = 1; x = 0; char s = getchar();
	while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
	while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
	x *= f;
}

const int N = 2005, S = 1e6 + 5;

int n, l, q, t[N][N], f[N][N];
// j -> (i)
char s[N * 2];

int cnt[N];

bool st[N], vis[N][N];

set<int> G[N];

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

struct E{
	int a, b, id;
};

vector<E> e[N];

int ans[S], mode[N];

int F[N];

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

vector<PII> bf;

void mg(int x, int y) {
	x = find(x), y = find(y);
	if (x == y) return;
	if (G[x].size() > G[y].size()) swap(x, y);
	F[x] = y;
	for (int v: G[x]) {
		int z = find(v);
		if (!G[y].count(z)) {
			for (int i = 1; i <= n; i++) {
				if (find(i) == i) {
					if (vis[i][y] && !vis[i][z]) 
						bf.pb(mp(i, z));
				}
			}
			G[y].insert(z);
		}
	}
	for (int i = 1; i <= n; i++) {
		if (find(i) != i) continue;
		if (vis[i][x] && !vis[i][y])  bf.pb(mp(i, y));
		if (vis[x][i] && !vis[y][i]) bf.pb(mp(y, i));
		//vis[i][y] |= vis[i][x];
		//vis[y][i] |= vis[x][i];
	}
}

void clr() {
	for (int i = 0; i <= max(n, l); i++) st[i] = cnt[i] = 0;
	for (int i = 0; i <= q; i++) ans[i] = 0;
	for (int i = 0; i <= l; i++)
		for (int j = 0; j <= n; j++) f[i][j] = 0; 
	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= n; j++) vis[i][j] = 0;
	for (int i = 0; i <= l; i++) mode[i] = 0, e[i].clear();
	for (int i = 0; i <= n; i++) G[i].clear();
}

void dfs(int z, int u) {
	assert(!vis[z][u]);
	if (vis[z][u]) return;
	vis[z][u] = 1;
	for (int v: G[u]) {
		v = find(v);
		if (!vis[z][v]) {
			dfs(z, v);
		}
	}
}

int main() {
	int T; read(T);
	while (T--) {
		read(n), read(l), read(q);
		for (int i = 1; i <= n; i++) {
			vis[i][i] = 1;
		
			F[i] = i;
		}
		for (int i = 1; i <= l; i++) {
			scanf("%s", s + 1);
			int c = 0;
			for (int j = 1; s[j]; j += 2) {
				int v = get(s[j], s[j + 1]);
				t[i][++c] = v;
			}
			assert(c == n);
			 // for (int j = 1; j <= n; j++) cerr << t[i][j] << " ";
			 // cerr << endl;
		}
		for (int i = 1; i <= q; i++) {
			scanf("%s", s + 1);
			int a = get(s[1], s[2]);
			int b = get(s[3], s[4]);
			int c = get(s[5], s[6]);
			//cerr << a << " " << b << " " << c << endl;
			e[c].pb((E) { a, b, i });
		}

		for (int i = 1; i <= l; i++) {
			for (int j = 1; j <= n; j++) {
				int v = t[i][j];
				++cnt[v];
				if (cnt[v] >= 3) st[i] = 1;
			}
			int num = 0, v = -1, kw = 0;
			for (int j = 1; j <= n; j++) {
				if (cnt[j] == 2) num++, v = j;
				if (cnt[j] == 0) kw = j;
			}
			if (num > 1) st[i] = 1;
			if (!st[i]) {
				int x = 0, y = 0;
				for (int j = 1; j <= n; j++) {
					if (t[i][j] == v) {
						if (!x) x = j;
						else y = j;
					}
				}
				if (num == 0) {
					for (int j = 1; j <= n; j++)
						f[i][j] = t[i][j];
					mode[i] = 1;

				} else {
					mode[i] = 2;
					for (int j = 1; j <= n; j++) {
						if (cnt[t[i][j]] == 2) f[i][j] = kw, assert(j == x || j == y);
					}
				}
			}
			// cout << " out " << i << endl;
			// for (int j = 1; j <= n; j++) cout << f[i][j] << " ";
			// cout << endl;
			for (int j = 1; j <= n; j++) cnt[j] = 0;
		}

		for (int i = 0; i <= l; i++) {
			if (i && mode[i] == 2) for (int j = 1; j <= n; j++) {
				if (f[i][j]) {
					int a = j, b = f[i][j];
					a = find(a), b = find(b);
					G[a].insert(b);
					
					
					for (int v = 1; v <= n; v++) {
						//assert(vis[v][a]);
						if (v != find(v)) continue;
						if (vis[v][a] && !vis[v][b]) dfs(v, b);
					}
				}
			}
			if (i && mode[i] == 1) {
				for (int j = 1; j <= n; j++) {
					mg(j, f[i][j]); //, cerr << " mg" << j << " " << f[i][j] << endl;
					while (bf.size()) {
						PII u = bf.back();
						u.fi = find(u.fi), u.se = find(u.se);
						if (!vis[u.fi][u.se]) dfs(u.fi, u.se);
						bf.pop_back();
					}
				}
			}

			
			for (auto u: e[i])
				ans[u.id] |= vis[find(u.a)][find(u.b)];
		}

		for (int i = 1; i <= q; i++) printf("%d", ans[i]);
		puts("");
		//cerr << endl;
		clr();
	}
}