// Author: Floze3
// Time: 2024-07-30 20:34:33
// Problem: P10785 [NOI2024] 集合
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P10785
// Memory Limit:  MB
// Time Limit:  ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define mp(x, y) std::make_pair(x, y)
#define eb emplace_back
#define fi first
#define se second
#define il inline
#define all(x) x.begin(), x.end()
#define file(name)                 \
  freopen(name ".in", "r", stdin); \
  freopen(name ".out", "w", stdout);

typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;

#ifndef ONLINE_JUDGE
#define debug(x) \
  std::cerr << "In Line " << __LINE__ << ": " << #x << " = " << x << std::endl
#define look_time std::cerr << clock() * 1e3 / CLOCKS_PER_SEC << " ms\n"
#define look_memory std::cerr << fabs(&med - &mst) / 1024.0 / 1024.0 << " mb\n"
#else
#define debug(...) 42
#define look_time 42
#define look_memory 42
#endif

const int N = 2e5 + 5;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;

std::mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());

bool mst;

const ull msk = rng();

ull sa, sb, ap[N * 3], bp[N * 3], mp[N];
int n, m, q, rm[N], a[N][3], b[N][3];

il ull sft(ull x) {
  if (!x) return x;
  x ^= msk;
  x ^= x << 7;
  x ^= x >> 11;
  x ^= x << 13;
  return x;
}

il void del(int pos) {
  for (int i = 0; i < 3; ++i) {
    sa -= sft(ap[a[pos][i]]);
    ap[a[pos][i]] -= mp[pos];
    sa += sft(ap[a[pos][i]]);
  }
  for (int i = 0; i < 3; ++i) {
    sb -= sft(bp[b[pos][i]]);
    bp[b[pos][i]] -= mp[pos];
    sb += sft(bp[b[pos][i]]);
  }
  return ;
}

il void add(int pos) {
  for (int i = 0; i < 3; ++i) {
    sa -= sft(ap[a[pos][i]]);
    ap[a[pos][i]] += mp[pos];
    sa += sft(ap[a[pos][i]]);
  }
  for (int i = 0; i < 3; ++i) {
    sb -= sft(bp[b[pos][i]]);
    bp[b[pos][i]] += mp[pos];
    sb += sft(bp[b[pos][i]]);
  }
  return ;
}

bool med;

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr), std::cout.tie(nullptr);
  std::cin >> n >> m >> q;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 3; ++j) std::cin >> a[i][j];
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 3; ++j) std::cin >> b[i][j];
  }
  for (int i = 1; i <= n; ++i) mp[i] = rng();
  for (int i = 1; i <= n; ++i) rm[i] = n;
  add(1);
  for (int i = 1, j = 1; i <= n; del(i++)) {
    while (j <= n && sa == sb) {
      ++j;
      if (j <= n) add(j);
    }
    rm[i] = std::min(rm[i], j - 1);
  }
//  for (int i = 1; i <= n; ++i) std::cout << i << ' ' << rm[i] << '\n';
  while (q--) {
    int l, r;
    std::cin >> l >> r;
    std::cout << (r <= rm[l] ? "Yes\n" : "No\n");
  }
  return 0;
}

/*
all the things you do
the words you say
will all come back to you
*/