#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;
using ull = unsigned long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

constexpr ll inf = 1001001001001001001;

mt19937_64 mt(random_device{}());

int main() {
    int N, M, Q; scanf("%d%d%d", &N, &M, &Q);
    vector<array<int, 3>> A(N), B(N);
    rep (i, N) rep (j, 3) scanf("%d", &A[i][j]), --A[i][j];
    rep (i, N) rep (j, 3) scanf("%d", &B[i][j]), --B[i][j];
    vector<ull> X(N);
    rep (i, N) X[i] = mt();
    vector<int> R(N);
    int cur = 0;
    vector<ull> YA(M), YB(M);
    ull ZA = 0, ZB = 0;
    auto check = [&] {
        ull nxt_za = ZA, nxt_zb = ZB;
        rep (i, 3) nxt_za += (YA[A[cur][i]] ^ X[cur]) - YA[A[cur][i]];
        rep (i, 3) nxt_zb += (YB[B[cur][i]] ^ X[cur]) - YB[B[cur][i]];
        return nxt_za == nxt_zb;
    };
    rep (l, N) {
        while (cur < N && check()) {
            rep (i, 3) ZA += (YA[A[cur][i]] ^ X[cur]) - YA[A[cur][i]];
            rep (i, 3) ZB += (YB[B[cur][i]] ^ X[cur]) - YB[B[cur][i]];
            rep (i, 3) YA[A[cur][i]] ^= X[cur];
            rep (i, 3) YB[B[cur][i]] ^= X[cur];
            ++cur;
        }
        R[l] = cur;
        rep (i, 3) ZA += (YA[A[l][i]] ^ X[l]) - YA[A[l][i]];
        rep (i, 3) ZB += (YB[B[l][i]] ^ X[l]) - YB[B[l][i]];
        rep (i, 3) YA[A[l][i]] ^= X[l];
        rep (i, 3) YB[B[l][i]] ^= X[l];
    }
    rep (_, Q) {
        int l, r; scanf("%d%d", &l, &r);
        --l;
        puts(R[l] >= r ? "Yes" : "No");
    }
}