#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  x = max(x, y);
}
template <typename T>
void chkmin(T &x, const T &y) {
  x = min(x, y);
}
constexpr int MAXN = 2e5 + 10, MAXM = 6e5 + 10;
int n, m, q, a[MAXN][3], b[MAXN][3], lim[MAXN];
ull val[MAXN], pa[MAXM], pb[MAXM];
mt19937_64 rng;
unordered_map<ull, int> mp;
void update(ull x, int y) {
  auto it = mp.find(x);
  if (it != mp.end()) {
    it->second += y;
    if (!it->second) mp.erase(it);
  } else {
    mp[x] = y;
  }
}
void insert(int p) {
  for (auto i : a[p]) {
    update(pa[i], -1);
    pa[i] ^= val[p];
    update(pa[i], 1);
  }
  for (auto i : b[p]) {
    update(pb[i], 1);
    pb[i] ^= val[p];
    update(pb[i], -1);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m >> q;
  for (int i = 1; i <= n; ++i) val[i] = rng();
  for (int i = 1; i <= n; ++i)
    for (auto &j : a[i]) cin >> j;
  for (int i = 1; i <= n; ++i)
    for (auto &j : b[i]) cin >> j;
  for (int i = 1, j = 1; i <= n; ++i) {
    insert(i);
    while (!mp.empty()) insert(j++);
    lim[i] = j;
  }
  while (q--) {
    int l, r;
    cin >> l >> r;
    cout << (l >= lim[r] ? "Yes" : "No") << "\n";
  }
  return 0;
}
/*
g++ A.cpp -o A -std=c++17 -O2 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/