#include<bits/stdc++.h>
using ull = unsigned long long;
std::mt19937_64 Rand(std::chrono::steady_clock::now().time_since_epoch().count());
#define gc getchar
inline int read() {
   int x = 0, c = gc();
   while (! isdigit(c)) c = gc();
   while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
   return x;
}
const int maxn = 2e5 + 10, maxm = 6e5 + 10;
ull rd[maxn], val[2][maxm];
int a[2][maxn][3], R[maxn];
int main() {
   int n = read(), m = read(), q = read();
   for (int op : {0, 1})
      for (int i = 1; i <= n; i++)
         for (int j : {0, 1, 2})
            a[op][i][j] = read();
   for (int i = 1; i <= n; i++)
      rd[i] = Rand();
   std::unordered_map<ull, int> sum; int cnt = 0;
   auto upd = [&](ull x, int v) {
      cnt += ! sum[x], sum[x] += v, cnt -= ! sum[x];
   };
   auto add = [&](int id) {
      if (id > n) return ;
      for (int op : {0, 1})
         for (int i : {0, 1, 2}) {
            upd(val[op][a[op][id][i]], op ? -1 : 1);
            upd(val[op][a[op][id][i]] ^= rd[id], op ? 1 : -1);
         }
   };
   for (int l = 1, r = 0; l <= n; add(l++)) {
      while (r <= n && ! cnt) add(++r);
      R[l] = r - 1;
   }
   for (int l, r; q--; ) {
      l = read(), r = read();
      puts(r <= R[l] ? "Yes" : "No");
   }
   return 0;
}