#include <stdio.h>
#include <string.h>

#include <bitset>
#include <vector>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define eb emplace_back

using namespace std;

typedef long long LL;
typedef unsigned long long u64;
constexpr int N = 4005, M = 1000005;

int n, m, Q;
char a[N];
struct Edge {
	int x, y;
	Edge() {}
	Edge(int _x, int _y) : x(_x), y(_y) {}
};
vector<Edge> v[N];
struct Req {
	int x, y, k;
	Req() {}
	Req(int _x, int _y, int _k) : x(_x), y(_y), k(_k) {}
};
vector<Req> rq[N];
int res[M];

void work(vector<Edge> &v) {
	static int b[N], c[N];
	memset(c, 0, n << 2);
	scanf("%s", a);
	for (int i = 0; i < 2 * n; ++i) {
		a[i] -= 48;
	}
	memset(c, 0, n << 2);
	for (int i = 0; i < n; ++i) {
		b[i] = a[2 * i] * 50 + a[2 * i + 1] - 1;
		++c[b[i]];
	}
	int rt = -1;
	for (int x = 0; x < n; ++x) {
		if (c[x] > 2) {
			return;
		}
		if (c[x] < 2) {
			continue;
		}
		if (~rt) {
			return;
		}
		rt = x;
	}
	if (rt == -1) {
		for (int x = 0; x < n; ++x) {
			v.eb(x, b[x]);
		}
		return;
	}
	int t = -1;
	for (int x = 0; x < n; ++x) {
		if (!c[x]) {
			t = x;
			break;
		}
	}
	for (int x = 0; x < n; ++x) {
		if (c[b[x]] == 2) {
			v.eb(x, t);
		}
	}
}

int p[N];
u64 g[2000][40];

int fd(int x) {
	return x != p[x] ? p[x] = fd(p[x]) : x;
}

void add(int x, int y) {
	for (int z = 0; z < n; ++z) {
		if (g[z][x >> 6] >> (x & 63) & 1) {
			for (int t = 0; t < 40; ++t) {
				g[z][t] |= g[y][t];
			}
		}
	}
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		scanf("%d%d%d", &n, &m, &Q);
		for (int i = 0; i <= m; ++i) {
			rq[i].clear();
			v[i].clear();
		}
		for (int i = 0; i < m; ++i) {
			work(v[i]);
		}
		for (int i = 0; i < Q; ++i) {
			scanf("%s", a);
			for (int j = 0; j < 6; ++j) {
				a[j] -= 48;
			}
			int x = a[0] * 50 + a[1] - 1;
			int y = a[2] * 50 + a[3] - 1;
			int z = a[4] * 50 + a[5];
			rq[z].eb(x, y, i);
		}
		for (int x = 0; x < n; ++x) {
			p[x] = x;
			memset(g[x], 0, sizeof g[x]);
			g[x][x >> 6] |= 1ull << (x & 63);
		}
		for (int i = 0; i <= m; ++i) {
			for (auto [x, y, k] : rq[i]) {
				res[k] = g[x][y >> 6] >> (y & 63) & 1;
			}
			if (v[i].size() < 3) {
				for (auto [x, y] : v[i]) {
					add(x, y);
				}
				continue;
			}
			for (auto [x, y] : v[i]) {
				x = fd(x), y = fd(y);
				if (x == y) {
					continue;
				}
				p[x] = y;
				add(x, y), add(y, x);
			}
		}
		for (int i = 0; i < Q; ++i) {
			printf("%d", res[i]);
		}
		puts("");
	}
	return 0;
}