#include<bits/stdc++.h> 
#define ull unsigned long long
#define lch(x) t[x].s[0] 
#define rch(x) t[x].s[1]
#define INF 0x3f3f3f3f
#define ll long long 
#define lll __int128
#define re register
#define inl inline
#define N 1000050
#define rx x<<1|1
#define lx x<<1
using namespace std;

inline int read(){
	int w = 1 ,s = 0;
	char ch = getchar();
	while(!isdigit(ch)){
		if(ch=='-') w = -1;
		ch = getchar();
	}
	while(isdigit(ch)){
		s = (s<<3)+(s<<1)+ch-'0';
		ch = getchar();		
	}
	return w*s;
}

struct query{
	int time ,a ,b ,id ;
	bool operator<(const query&a) const{
		return time < a.time ;
	}
} ;

int cnt ,cnt1 ,top ,n ;
int scc[N] ,low[N] ,dfn[N] ,isstk[N] ,stk[N] ,ind[N] ;

bitset<2005> f[2005] ;

std::vector<int> v[2005] ,adj[2005] ;

int g[N] ,F[N] ;

int find(int x){
	if(x == g[x]) return x ;
	return g[x] = find(g[x]) ;
}

void tarjan(int x){
	dfn[x] = low[x] = ++ cnt ;
	isstk[x] = 1 ,stk[++top] = x ;
	for(auto v : adj[x]){
		if(!dfn[v]){
			tarjan(v) ;
			low[x] = min(low[x],low[v]) ;
		}
		else if(!F[v]) low[x] = min(low[x],dfn[v]) ;
	}

	if(dfn[x] == low[x]){
		cnt1 ++ ;
		int y ;
		//int p = find(x) ;
		do{
			y = stk[top--] ;
			//g[find(y)] = p ;
			F[y] = x ;
			isstk[y] = false ;
		}while(y != x) ;
	}
}

void getpath(){
	for(int i = 1;i <= n;i ++ ) ind[i] = 0 ;
	for(int i = 1;i <= n;i ++ ){
		for(auto vv : adj[i]){
			//if(find(vv) == find(i)) continue ;
			v[vv].push_back(i) ;
			ind[i] ++ ; 
		}
	}
}

void toposort(){
	queue<int> q ;
	for(int i = 1;i <= n;i ++ ) if(!ind[i]) q.push(i) ;
	while(!q.empty()){
		int x = q.front() ;
		q.pop() ;
		for(auto to : v[x]){
			f[to] |= f[x] ;
			if(!--ind[to]) q.push(to) ;
		}
	}
}

void solve(){
	int m ,q ;
	cin >> n >> m >> q ;
	std::vector<std::vector<int>> t(m+1) ;
	std::vector<int> num(n+1) ,anx(q) ;
	std::vector<query> Q(q) ;

	auto get = [&](){
		char s1 ,s2 ;
		cin >> s1 >> s2 ;
		int p1 = (s1 - 48) * 50 + s2 - 48 ;
		return p1 ;
	} ;

	for(int i = 1;i <= n;i ++ ){
		g[i] = i ;
		adj[i].clear() ;
	}
	for(int i = 1;i <= m;i ++ ){
		for(int j = 1;j <= n;j ++ ){
			int p = get() ;
			t[i].push_back(p) ;
		}
	}
	cnt = cnt1 = n ;
	for(int i = 1;i <= n;i ++ ) {
		f[i].reset() ;
		f[i][i] = 1 ;
		dfn[i] = 0 ;
		v[i].clear() ;
	}

	for(int i = 0;i < q;i ++ ) {
		int a = get() ,b = get() ,c = get() ;
		Q[i] = {c,a,b,i} ;
	}
	sort(Q.begin(),Q.end()) ;

	int time = 0 ;
	for(int i = 0;i < q;i ++ ){
		while(time + 1 <= m && time + 1 <= Q[i].time){
			time ++ ;
			for(int i = 1;i <= n;i ++ ) num[i] = F[i] = 0 ;
			for(auto val : t[time]) num[val] ++ ;
			std::vector<std::vector<int>> nadj(n+1) ;
			int sum = 0 ,px = 0 ;
			for(int i = 1;i <= n;i ++ ) {
				sum += !num[i] ;
				if(num[i] >= 2) px = i ;
			}
			if(!px){
				for(int i = 0;i < n;i ++ ){
					int to = t[time][i] ;
					if(find(i+1) != find(to)){
						adj[find(i+1)].push_back(find(to)) ;
					}
				}
			}
			else if(sum < 2) {
				int p = 0 ;
				for(int i = 0;i < n;i ++ ){
					if(!num[i+1]) p = i + 1 ;
				}
				if(p){
					for(int i = 0;i < n;i ++ ){
						if(t[time][i] == px && find(i+1) != find(p)){
							adj[find(i+1)].push_back(find(p)) ;
						}
					}
				}
			}
			//  int mul = -1, zero = -1, ok = 1;
			//   for (int j = 1; j <= n; ++j) {
	        //     if (num[j] == 2) {
	        //         if (mul == -1) mul = j;
	        //         else ok = 0;
	        //     }
	        //     if (num[j] == 0) {
	        //         if (zero == -1) zero = j;
	        //         else ok = 0;
	        //     }
        	// }
        	// //if (!ok) continue;
        	//  if (mul == -1 && ok) {
	        //     for (int j = 1; j <= n; ++j) {
	        //         adj[find(j)].emplace_back(find(t[time][j-1]));
	        //     }
	        // }
	        // else if(ok) for (int j = 1; j <= n; ++j) {
	        //     if (num[t[time][j-1]] == 2) {
	        //        adj[find(j)].emplace_back(find(zero));
	        //     }
	        // }
			for(int i = 1;i <= n;i ++ ) dfn[i] = num[i] = low[i] = isstk[i] = 0 ;
			cnt = cnt1 = top = 0 ;
			for(int i = 1;i <= n;i ++ ) if(!dfn[i]){
				tarjan(i) ;
			}
			for(int i = 1;i <= n;i ++ ){
				int fa = find(i) ;
				for(auto to : adj[i]){
					int u = find(to) ;
					if(F[i] != F[to]) nadj[F[i]].push_back(F[to]) ;
				}
			}
			for(int i = 1;i <= n;i ++ ) {
				int x = find(i) ,p = find(F[i]) ;
				g[x] = p ;
				//if(find(i) != i) continue ;
				sort(nadj[i].begin(),nadj[i].end()) ;
				nadj[i].erase(unique(nadj[i].begin(),nadj[i].end()),nadj[i].end()) ;
				adj[i] = nadj[i] ;
			}
			for(int i = 1;i <= n;i ++ ) v[i].clear() ,f[i].reset() ,f[i][i] = 1 ;
			getpath() ;
			//for(int i = 1;i <= n;i ++ ) f[find(i)] |= 1 << find(i) ;
			toposort() ;
		}
		int a = find(Q[i].a) ,b = find(Q[i].b) ,c = Q[i].time ;
		anx[Q[i].id] = f[a][b] ;
		//cout << time << endl ;
	}
	for(int i = 0;i < q;i ++ ) cout << anx[i] ;
	cout << endl ;
}

int main(){
	ios::sync_with_stdio(false);
	
	int t ;
	cin >> t ;
	while(t -- )
	solve() ;
}