#include <bits/stdc++.h>
#define X first
#define Y second
#define mp make_pair
#define gc getchar
#define pc putchar
#define rep(i, a, b) for(int i = a; i <= b; i++)
using namespace std;
using ld = double;
typedef unsigned long long int ll;
using pli = pair<ll, int>;
using ppi = pair<pli, int>;
using vec = vector<int>;
const ll inf = 1LL << 60;
constexpr int maxn = 6e5 + 10;
mt19937_64 rd(114514); int n, m, q, T = 5; 
int a[2][maxn][4], R[maxn]; ll w[maxn], h[2][maxn], s[2], B;
inline ll trs(ll k) { return (k << 3 ^ k >> 7 ^ k << 17 ^ k ^ 0x3f5d2a) ^ B; }
inline void add(int p, int del) {
    rep(o, 0, 1) {
        rep(i, 1, 3) {
            int u = a[o][p][i];
            s[o] += trs(h[o][u]), h[o][u] += w[p] * del, s[o] -= trs(h[o][u]);
        }
    }
}
int main() {
    scanf("%d%d%d", &n, &m, &q); rep(i, 1, n) R[i] = n; rd.seed(time(NULL)); B = rd();
    rep(o, 0, 1) rep(i, 1, n) rep(j, 1, 3) scanf("%d", &a[o][i][j]);
    while (T--) {
        rd.seed(rd()); s[0] = s[1] = 0;
        rep(i, 1, n) w[i] = rd(); add(1, 1);
        for (int l = 1, r = 1; l <= n; add(l++, -1)) {
            while (r <= n && s[0] == s[1]) {
                if (++r <= n) add(r, 1);
                else break;
            }
            R[l] = min(R[l], r - 1);
        }
    }
    while (q--) {
        int l, r;
        scanf("%d%d", &l, &r);
        puts(r <= R[l] ? "Yes" : "No");
    }
    return 0;
}