#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


int decode(char *s) {
  return (s[0] - 48) * 50 + (s[1] - 48);
}

char buf[4010];

int N, L, Q;
int T[2010][2010];
vector<int> A, B, C;

vector<pair<int, int>> graph[2010];
void ae(int u, int v, int c) {
// cerr<<"[ae] "<<u<<" "<<v<<" "<<c<<endl;
  graph[u].emplace_back(c, v);
}

int dist[2010][2010];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d%d", &N, &L, &Q);
    for (int i = 0; i < L; ++i) {
      scanf("%s", buf);
      for (int u = 0; u < N; ++u) {
        T[i][u] = decode(buf + u*2) - 1;
      }
// pv(T[i],T[i]+N);
    }
    A.resize(Q);
    B.resize(Q);
    C.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%s", buf);
      A[q] = decode(buf + 0) - 1;
      B[q] = decode(buf + 2) - 1;
      C[q] = decode(buf + 4);
    }
    
    for (int u = 0; u < N; ++u) graph[u].clear();
    uf.assign(N, -1);
    for (int i = 0; i <= L; ++i) {
      if (i < L) {
        vector<int> us(N, -1);
        int a = -1, b = -1;
        for (int u = 0; u < N; ++u) {
          if (~us[T[i][u]]) {
            if (~a) goto failed;
            a = us[T[i][u]];
            b = u;
          } else {
            us[T[i][u]] = u;
          }
        }
        if (~a) {
          for (int v = 0; v < N; ++v) if (!~us[v]) {
            ae(a, v, i + 1);
            ae(b, v, i + 1);
          }
        } else {
          for (int u = 0; u < N; ++u) {
            const int v = T[i][u];
            if (connect(u, v)) {
              ae(u, v, i + 1);
              ae(v, u, i + 1);
            }
          }
        }
       failed:{}
      }
    }
    
    for (int s = 0; s < N; ++s) {
      vector<vector<int>> ques(L + 1);
      fill(dist[s], dist[s] + N, L + 1);
      ques[dist[s][s] = 0].push_back(s);
      for (int c = 0; c <= L; ++c) {
        for (int head = 0; head < (int)ques[c].size(); ++head) {
          const int u = ques[c][head];
          if (dist[s][u] == c) {
            for (const auto &e : graph[u]) {
              const int cc = max(c, e.first);
              const int v = e.second;
              if (chmin(dist[s][v], cc)) {
                ques[cc].push_back(v);
              }
            }
          }
        }
      }
// cerr<<"dist["<<s<<"] = ";pv(dist[s],dist[s]+N);
    }
    
    string ans(Q, '?');
    for (int q = 0; q < Q; ++q) {
      ans[q] = (dist[A[q]][B[q]] <= C[q]) ? '1' : '0';
    }
    puts(ans.c_str());
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}