#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
mt19937_64 rng(time(0));
ull hsh[2005];
int t[2005][2005];
bitset<2005> to[2005], from[2005];
int decode(char a, char b) {
  int x = a - 48;
  int y = b - 48;
  return x * 50 + y;
}
void solve() {
  int n, l, q;
  cin >> n >> l >> q;
  for (int i = 0; i < l; i++) {
    string s;
    cin >> s;
    for (int j = 0; j < n; j++) {
      t[i][j] = decode(s[j * 2], s[j * 2 + 1]);
      t[i][j] -= 1;
    }
  }
  vector<int> ans(q);
  vector<vector<tuple<int, int, int>>> que(l);
  for (int i = 0; i < q; i++) {
    string s;
    cin >> s;
    int a = decode(s[0], s[1]), b = decode(s[2], s[3]), c = decode(s[4], s[5]);
    if (c == 0) {
      ans[i] = (a == b);
    } else {
      a--, b--, c--;
      que[c].push_back({a, b, i});
    }
  }
  vector<ull> h(l);
  vector<vector<pair<int, int>>> add(l);
  for (int i = 0; i < l; i++) {
    for (int j = 0; j < n; j++)
      h[i] += hsh[t[i][j]];
  }
  ull all = 0;
  for (int i = 0; i < n; i++)
    all += hsh[i];
  for (int a = 0; a < n; a++) {
    unordered_map<ull, int> mp;
    for (int i = 0; i < l; i++) {
      ull cur = h[i] - hsh[t[i][a]];
      if (!mp.count(cur))
        mp[cur] = i;
    }
    for (int b = 0; b < n; b++) {
      ull cur = all - hsh[b];
      if (mp.count(cur)) {
        int x = mp[cur];
        add[x].push_back({a, b});
      }
    }
  }
  for (int i = 0; i < n; i++)
    to[i].reset(), from[i].reset();
  vector<pair<int, int>> qu;
  auto upd = [&](int a, int b) {
    qu.clear();
    qu.emplace_back(a, b);
    from[a][b] = to[b][a] = 1;
    for (int i = 0; i < (int)qu.size(); i++) {
      auto [x, y] = qu[i];
      {
        auto cur = (~from[x]) & from[y];
        for (int nx = cur._Find_first(); nx < n; nx = cur._Find_next(nx)) {
          from[x][nx] = to[nx][x] = 1;
          qu.emplace_back(x, nx);
        }
      }
      {
        auto cur = (~to[y]) & to[x];
        for (int nx = cur._Find_first(); nx < n; nx = cur._Find_next(nx)) {
          from[nx][y] = to[y][nx] = 1;
          qu.emplace_back(nx, y);
        }
      }
    }
  };
  for (int i = 0; i < n; i++)
    upd(i, i);
  for (int i = 0; i < l; i++) {
    for (auto [x, y] : add[i])
      upd(x, y);
    for (auto [x, y, id] : que[i])
      ans[id] = from[x][y];
  }
  for (int i = 0; i < q; i++) {
    cout << ans[i];
  }
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  for (int i = 0; i < 2005; i++) {
    hsh[i] = rng();
  }
  int T;
  cin >> T;
  while (T--) {
    solve();
  }
}