#include<bits/stdc++.h>
using namespace std;
int T, n, l, q, m;
char s[50000];
int x[100000], y[100000], z[100000], vn[30000], r[200000], w[200000];
int bk[30000], dis[5000][5000], p[30000];
int bin[30000];
int decry(char ha, char la){
	return (ha-'0') * 50 + la-'0';
}
int find(int x){
	if(bin[x] == x) return x;
	return bin[x] = find(bin[x]);
}
void add(int xx, int yy, int k){
	x[++m] = xx;
	y[m] = yy;
	z[m] = k;
}
void comb(int xx, int yy, int k){
	xx = find(xx);
	yy = find(yy);
	if(xx == yy) return;
	bin[xx] = yy;
	add(xx, yy, k);
	add(yy, xx, k);
}
struct Node{
	int val, num;
	Node(int xx = 0, int yy = 0){
		val = xx;
		num = yy;
	}
	friend bool operator < (const Node & s1, const Node & s2){
		return s1.val > s2.val;
	}
};
priority_queue<Node> heap;
char aans[2000000];
int main(){
	int i, j, k;
	int cnt1 = 0, cnt2 = 0, fflag = 0;
	scanf("%d", &T);
	while(T--){
		scanf("%d%d%d", &n, &l, &q);
		for(i = 1; i <= n + 1; ++i){
			bin[i] = i;
			vn[i] = 0;
		}
		m = 0;
		for(i = 1; i <= l; ++i){
			int flag = 1;
			scanf("%s", s);
			for(j = 1; j <= n; ++j){
				bk[j] = 0;
			}
			for(j = 1; j <= n; ++j){
				p[j] = decry(s[2 * j - 2], s[2 * j - 1]);
				if(p[j] > n) flag = 0;
				else bk[p[j]]++;
			}
			for(j = 1; j <= n; ++j){
				if(bk[j] == 1) continue;
				if(bk[j] > 2) flag = 0;
				else if(bk[j] == 2){// bk[j] == 2
					if(flag == 1) flag = 2;
					else flag = 0;
				}
			}
			if(flag == 0) continue;
			if(flag == 1){
				for(j = 1; j <= n; ++j){
					comb(j, p[j], i);
				}
				cnt1++;
			} else{// flag == 2
				int v1 = -1, v2 = -1, v = -1;
				for(j = 1; j <= n; ++j){
					if(bk[j] == 0) v = j;
					if(bk[p[j]] == 2){
						if(v1 == -1) v1 = j;
						else v2 = j;
					}
				}
				add(v1, v, i);
				add(v2, v, i);
				cnt2++;
			}
		}
		if(fflag) printf("1=%d 2=%d\n", cnt1, cnt2);
		for(i = 1; i <= m; ++i){
//			printf("%d->%d %d\n", x[i], y[i], z[i]);
			vn[x[i]]++;
		}
		for(i = 1; i <= n + 1; ++i){
			vn[i] += vn[i - 1];
		}
		for(i = 1; i <= m; ++i){
			r[--vn[x[i]]] = y[i];
			w[vn[x[i]]] = z[i];
		}
		Node v;
		for(i = 1; i <= n; ++i){
//			printf("%d:", i);
			for(j = 1; j <= n; ++j) dis[i][j] = 3000;
			for(j = 1; j <= n; ++j) bk[j] = 0;
			dis[i][i] = 0;
			bk[i] = 0;
			heap.push(Node(0, i));
			while(!heap.empty()){
				v = heap.top();
				heap.pop();
				if(bk[v.num] || dis[i][v.num] != v.val){
					continue;
				}
//				printf("v:%d\n", v.num);
				bk[v.num] = 1;
				for(j = vn[v.num]; j < vn[v.num + 1]; ++j){
					if(dis[i][r[j]] > max(dis[i][v.num], w[j])){
						dis[i][r[j]] = max(dis[i][v.num], w[j]);
						heap.push(Node(dis[i][r[j]], r[j]));
					}
				}
			}
//			for(j = 1; j <= n; ++j){
//				printf("%d ", dis[i][j]);
//			}
//			printf("\n");
		}
		int a, b, c;
		aans[q] = 0;
		for(int i = 0; i < q; ++i){
			scanf("%s", s);
			a = decry(s[0], s[1]);
			b = decry(s[2], s[3]);
			c = decry(s[4], s[5]);
//			if(fflag && i == 0)
//			printf("a=%d b=%d c=%d\n", a, b, c);
			if(dis[a][b] > c){
				aans[i] = '0';
			} else {
				aans[i] = '1';
			}
		}
		if(!fflag)
		printf("%s\n", aans);
	}
	return 0;
}
/*
5 1 2
0102020304
040501
030501
*/