/*
 * _|_|_|_|_|  _|_|_|_|    _|_|_|  _|_|_|_|_|  _|_|_|      _|_|
 *       _|    _|        _|                _|        _|  _|    _|
 *     _|      _|_|_|      _|_|          _|      _|_|        _|
 *   _|        _|              _|      _|            _|    _|
 * _|_|_|_|_|  _|        _|_|_|      _|        _|_|_|    _|_|_|_|
 */

#include <bits/stdc++.h>

std::mt19937_64 engine(
    std::chrono::steady_clock::now().time_since_epoch().count());

int main() {
#ifdef LOCAL
  freopen("task.in", "r", stdin);
  freopen("task.out", "w", stdout);
  freopen("task.err", "w", stderr);
#endif
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n, m, q, bad = 0;
  std::cin >> n >> m >> q;

  std::vector<std::array<int, 3>> a(n), b(n);
  for (auto &i: a) for (auto &j: i) std::cin >> j, j--;
  for (auto &i: b) for (auto &j: i) std::cin >> j, j--;

  std::vector<unsigned long long> val(n), A(m), B(m);
  std::unordered_map<unsigned long long, int> hash;
  for (int i = 0; i < n; i++) val[i] = engine();

  auto Insert = [&](auto val, int num) {
    bad -= hash[val] != 0;
    hash[val] += num;
    bad += hash[val] != 0;
  };

  auto Toggle = [&](int x) {
    if (x == n) return;
    for (int i = 0; i < 3; i++) {
      Insert(A[a[x][i]], -1);
      Insert(B[b[x][i]], +1);
      A[a[x][i]] ^= val[x];
      B[b[x][i]] ^= val[x];
      Insert(A[a[x][i]], +1);
      Insert(B[b[x][i]], -1);
    }
  };

  std::vector<int> pr(n);

  for (int l = 0, r = -1; l < n; Toggle(l++)) {
    while (r < n && bad == 0)
      Toggle(++r);
    pr[l] = r;
  }

  while (q--) {
    int l, r;
    std::cin >> l >> r, l--, r--;
    std::cout << (pr[l] <= r ? "No\n" : "Yes\n");
  }

  return 0;
}