10分求条！

#include<bits/stdc++.h>
using namespace std;
vector <int> pnum[2000010];
int n,k,q,T,dp[321][54321],len,x,y;
int read(){
	int ret=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
	while(isdigit(ch))ret=ret*10+ch-'0',ch=getchar();
	return ret*f;
}
void solve(){
	n=read(),k=read(),q=read();
	for(int i=1;i<=n;i++){
		pnum[i].clear();
		len=read();
		for(int j=1;j<=len;j++){
			x=read();
			pnum[i].push_back(x);
		}
	}
	memset(dp,-1,sizeof dp);
 	dp[0][1]=0;
	for(int r=1;r<=100;r++){
		for(int i=1;i<=n;i++){
			len=0;
			for(int j=0;j<pnum[i].size();j++){
				int d=pnum[i][j];
				len--;
				if(len>0){
					if(dp[r][d]==-1)dp[r][d]=i;
					else if(dp[r][d]&&dp[r][d]!=i)dp[r][d]=0;
				}
				if(dp[r-1][d]!=-1&&dp[r-1][d]!=i){
					len=k;
				}
			}
		}
	}
	for(int i=1;i<=q;i++){
		x=read(),y=read();
		printf("%d\n",dp[x][y]==-1?0:1);
	}
}
int main(){
	T=read();
	while(T--)solve();
}