/**
 * @author n685
 * @brief
 * @date 2024-08-02 15:07:49
 *
 *
 */
#include <bits/stdc++.h>

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbgP(...) 420
#define dbgRP(...) 420420
void nline() {}
void bar() {}
#endif

std::mt19937_64
    rng(std::chrono::steady_clock::now().time_since_epoch().count());
std::unordered_map<uint64_t, uint64_t> mp;
uint64_t get_hash(uint64_t val) {
  if (mp.contains(val)) {
    return mp[val];
  }
  return mp[val] = rng() % (1ULL << 56);
}

int main() {
#ifndef LOCAL
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
#endif

  int n, m, q;
  std::cin >> n >> m >> q;
  std::vector<uint64_t> va(m), vb(m);
  std::vector<std::array<int, 3>> a(n), b(n);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < 3; ++j) {
      std::cin >> a[i][j];
      --a[i][j];
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < 3; ++j) {
      std::cin >> b[i][j];
      --b[i][j];
    }
  }
  uint64_t ta = m * get_hash(0), tb = m * get_hash(0);
  auto add_a = [&](int v, int pos) {
    ta -= get_hash(va[v]);
    va[v] ^= get_hash(pos);
    ta += get_hash(va[v]);
  };
  auto add_b = [&](int v, int pos) {
    tb -= get_hash(vb[v]);
    vb[v] ^= get_hash(pos);
    tb += get_hash(vb[v]);
  };
  std::vector<int> pl(n);
  {
    int l = 0;
    for (int r = 0; r < n; ++r) {
      for (int i = 0; i < 3; ++i) {
        add_a(a[r][i], r);
        add_b(b[r][i], r);
      }
      while (l < r && ta != tb) {
        for (int i = 0; i < 3; ++i) {
          add_a(a[l][i], l);
          add_b(b[l][i], l);
        }
        ++l;
      }
      assert(ta == tb);
      pl[r] = l;
    }
  }
  while ((q--) != 0) {
    int l, r;
    std::cin >> l >> r;
    --l;
    --r;
    if (pl[r] <= l) {
      std::cout << "Yes\n";
    } else {
      std::cout << "No\n";
    }
  }
}