// #pragma GCC optimize(2, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
#define endl "\n"
const int N = 2010, M = 1e6 + 5;

int n, m, Q;
int t[N][N], d[N], ok[N];
bitset<N> bit[N];
void add(int x, int y) {
  for (int i = 1; i <= n; ++i)
    if (bit[i][y]) bit[i] |= bit[x];
}
void mysolve() {
  cin >> n >> m >> Q;
  string s;
  for (int i = 1; i <= m; ++i) {
    cin >> s, ok[i] = 0;
    vector<int> tmp(n + 1);
    for (int j = 0; j < (int)s.size(); j += 2) {
      int a = s[j] - 48, b = s[j + 1] - 48, x = a * 50 + b;
      t[i][(j >> 1) + 1] = x, tmp[x]++;
      if (tmp[x] > 2) ok[i] = -1;
      else if (tmp[x] == 2) {
        if (!ok[i]) ok[i] = x;
        else ok[i] = -1;
      }
    }
  }
  vector<array<int, 4>> ask;
  for (int i = 1; i <= Q; ++i) {
    cin >> s;
    for (int i = 0; i < (int)s.size(); i += 2) {
      int a = s[i] - 48, b = s[i + 1] - 48;
      d[i >> 1] = a * 50 + b;
    }
    ask.push_back({d[2], d[0], d[1], i});
  }
  sort(ask.begin(), ask.end());
  for (int i = 0; i <= n; ++i) bit[i].reset(), bit[i][i] = 1;
  int j = 0;
  vector<int> ans(Q + 1);
  for (int i = 1; i <= m; ++i) {
    while (j < (int)ask.size() && ask[j][0] < i) {
      auto [tim, a, b, id] = ask[j++];
      ans[id] = bit[b][a];
    }
    if (!ok[i]) {
      for (int k = 1; k <= n; ++k) add(k, t[i][k]);
    } else if (~ok[i]) {
      vector<int> now;
      for (int k = 1; k <= n; ++k)
        if (t[i][k] == ok[i]) now.push_back(k);
      set<int> mex;
      for (int k = 1; k <= n; ++k) mex.insert(t[i][k]);
      for (int k = 1; k <= n; ++k)
        if (!mex.count(k)) {
          for (auto v : now) add(v, k);
          break;
        }
    }
  }
  while (j < (int)ask.size()) {
    auto [tim, a, b, id] = ask[j++];
    ans[id] = bit[b][a];
  }
  for (int i = 1; i <= Q; ++i) cout << ans[i];
  cout << endl;
}

signed main() {
#ifdef DEBUG
  freopen("in.in", "r", stdin);
  freopen("out.out", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); // 使用read请把解绑注释了
  int t = 1;
  cin >> t;
  while (t--) {
    mysolve();
  }
  return 0;
}