#include <bits/stdc++.h>

typedef long long int64;
typedef long double db;

const int N=2000,M=1000000;

int n,m,cq,to[N+9][N+9];
std::vector<std::tuple<int,int,int>> q[N+9];

void Read(){
  std::cin>>n>>m>>cq;
  auto read=[&](int *a){
    std::string s;
    std::cin>>s;
    int n=s.size()/2;
    for (int i=0;i<n;++i)
      a[i]=(s[i<<1]-48)*50+(s[i<<1|1]-48);
  };
  for (int i=1;i<=m;++i)
    read(to[i]+1);
  for (int i=0;i<=m;++i) q[i].clear();
  for (int i=1;i<=cq;++i){
    int a[3];
    read(a);
    q[a[2]].emplace_back(a[0],a[1],i);
  }
}

std::bitset<N+9> e[N+9];

void Add(int x,int y){
  if (e[x][y]) return;
  for (int z=1;z<=n;++z)
    if (e[z][x]) e[z]|=e[y];
}

void Add(int *p){
  static int cnt[N+9];
  for (int i=1;i<=n;++i) cnt[i]=0;
  for (int i=1;i<=n;++i) ++cnt[p[i]];
  int c0=0;
  for (int i=1;i<=n;++i)
    if (cnt[i]==0) ++c0;
  if (c0>1) return;
  if (c0){
    int p0=0,p2=0;
    for (int i=1;i<=n;++i){
      if (cnt[i]==2) p2=i;
      if (cnt[i]==0) p0=i;
    }
    for (int i=1;i<=n;++i)
      if (p[i]==p2) Add(i,p0);
  }else{
    for (int i=1;i<=n;++i)
      Add(i,p[i]);
  }
}

bool ans[M+9];

void Solve(){
  for (int x=1;x<=n;++x){
    e[x].reset();
    e[x][x]=1;
  }
  for (int i=0;i<=m;++i){
    if (i) Add(to[i]);
    for (auto [x,y,id]:q[i])
      ans[id]=e[x][y];
  }
  for (int i=1;i<=cq;++i)
    std::cout<<ans[i];
  std::cout<<'\n';
}

void work(){
  Read();
  Solve();
}

int main(){
  std::ios::sync_with_stdio(0);
  // std::cin.tie(0);
  int T=1;
  std::cin>>T;
  for (;T--;) work();
  return 0;
}