#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
struct DSU
{
	vector<int> f;
	DSU(int n)
	{
		f.resize(n + 1);
		for (int i = 0; i <= n; i++)
			f[i] = i;
	}
	int find(int x)
	{
		return f[x] != x ? f[x] = find(f[x]) : x;
	}
	void merge(int x, int y)
	{
		if (find(x) != find(y))
			f[find(x)] = y;
	}
};
struct Graph
{
	vector<vector<pair<int, int>>> G;
	int n;
	struct Subgraph
	{
		vector<int> dis;
		vector<vector<pair<int, int>>> &G;
		int n;
		Subgraph(int n, vector<vector<pair<int, int>>> &G) : n(n), G(G)
		{
			dis = vector<int>(n + 1, inf);
		}
		void getPath(int x)
		{
			dis[x] = 0;
			vector<int> vis(n + 1);
			priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
			for (int i = 1; i <= n; i++)
				if (dis[i] != inf)
					q.push({dis[i], i});
			while (q.empty() == false)
			{
				auto [d, x] = q.top();
				q.pop();
				if (vis[x])
					continue;
				vis[x] = 1;
				for (auto [y, c] : G[x])
				{
					if (dis[y] > max(dis[x], c))
					{
						dis[y] = max(dis[x], c);
						q.push({dis[y], y});
					}
				}
			}
		}
	};
	vector<Subgraph> g;
	Graph(int n) : n(n)
	{
		G = vector<vector<pair<int, int>>>(n + 1);
		g = vector<Subgraph>(n + 1, Subgraph(n, G));
	}
	void add(int x, int y, int c)
	{
		if (x == y)
			return;
		G[x].push_back({y, c});
	}
	void getPath()
	{
		for (int i = 1; i <= n; i++)
			g[i].getPath(i);
	}
	void link(int x, int y, int c)
	{
		g[x].dis[y] = min(g[x].dis[y], c);
		g[y].dis[x] = min(g[y].dis[x], c);
	}
	int query(int x, int y)
	{
		return g[x].dis[y];
	}
};
void work()
{
	int n, l, q;
	cin >> n >> l >> q;
	DSU dsu(n);
	Graph g(n);
	auto decode = [&](char ch1, char ch2)
	{
		int x = (int)(ch1 - '0') * 50 + (int)(ch2 - '0');
		return x;
	};
	for (int c = 1; c <= l; c++)
	{
		vector<int> t(n + 1), in(n + 1);
		for (int j = 1; j <= n; j++)
		{
			char ch1, ch2;
			cin >> ch1 >> ch2;
			t[j] = decode(ch1, ch2);
			in[t[j]]++;
		}
		int in1 = 0, in2 = 0, in2x = 0, in0x = 0;
		bool flag = 1;
		for (int i = 1; i <= n; i++)
		{
			if (in[i] > 2)
			{
				flag = 0;
				break;
			}
			if (in[i] == 1)
				in1++;
			else if (in[i] == 2)
				in2++, in2x = i;
			else if (in[i] == 0)
				in0x = i;
		}
		if (flag == 0)
			continue;
		if (in1 == n)
		{
			vector<int> vis(n + 1);
			for (int i = 1; i <= n; i++)
			{
				int x = i, lst = 0;
				if (!vis[x])
				{
					vector<int> proc;
					while (!vis[x])
					{
						vis[x] = 1;
						if (lst == 0 || dsu.find(lst) != dsu.find(x))
						{
							proc.push_back(x);
							if (lst)
								dsu.merge(lst, x);
						}
						lst = x;
						x = t[x];
					}
					for (int i = 0; i < proc.size(); i++)
						for (int j = i + 1; j < proc.size(); j++)
							g.link(proc[i], proc[j], c);
				}
			}
		}
		else if (in1 == n - 2 && in2 == 1)
		{
			vector<int> vis(n + 1);
			for (int i = 1; i <= n; i++)
				if (t[i] == in2x)
					g.add(i, in0x, c);
			int x = in0x;
			while (!vis[x])
			{
				vis[x] = 1;
				x = t[x];
			}
			for (int i = 1; i <= n; i++)
			{
				int x = i, lst = 0;
				if (!vis[x])
				{
					vector<int> proc;
					while (!vis[x])
					{
						vis[x] = 1;
						if (lst == 0 || dsu.find(lst) != dsu.find(x))
						{
							proc.push_back(x);
							if (lst)
								dsu.merge(lst, x);
						}
						lst = x;
						x = t[x];
					}
					for (int i = 0; i < proc.size(); i++)
						for (int j = i + 1; j < proc.size(); j++)
							g.link(proc[i], proc[j], c);
				}
			}
		}
		else
			continue;
	}
	g.getPath();
	for (int i = 1; i <= q; i++)
	{
		char ch[7];
		cin >> ch;
		int a = decode(ch[0], ch[1]), b = decode(ch[2], ch[3]), c = decode(ch[4], ch[5]);
		cout << (g.query(a, b) <= c ? '1' : '0');
	}
	cout << '\n';
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
		work();
}