#include <iostream>

#define PKRBT
//#undef PKRBT
#ifdef PKRBT
using std::cin;
using std::cout;
#else
#include <fstream>
std::ifstream cin("set.in");
std::ofstream cout("set.out");
#endif

#include <vector>
#include <array>
#include <random>
#include <unordered_map>
using std::vector;
#define F(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define dF(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define F2(i, n) F(i, 0, (int)(n) - 1)

// ==========================================

int main() {
#ifdef PKRBT
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    constexpr int K = 3;
    int n, m, q;
    cin >> n >> m >> q;
    vector<std::array<int, 3>> A(n), B(n);
    F2(i, n)
        F2(k, K)
            cin >> A[i][k],
            --A[i][k];
    F2(i, n)
        F2(k, K)
            cin >> B[i][k],
            --B[i][k];
    vector<int> lb(n); {
        using ULL = unsigned long long;
        vector<ULL> W(n); {
            std::mt19937_64 rng(0x20240718llu);
            F2(i, n)
                W[i] = rng();
        }
        vector<ULL> hash_A(m, 0), hash_B(m, 0);
        std::unordered_map<ULL, int> buk;
        int cnt = 0;
        auto modify = [&](ULL val, int c) {
            if (buk[val])
                --cnt;
            buk[val] += c;
            if (buk[val])
                ++cnt;
        };
        auto f = [&](int i, int c) {
            F2(k, K) {
                ULL &vA = hash_A[A[i][k]];
                modify(vA, -1);
                vA += c * W[i];
                modify(vA, 1);
            }
            F2(k, K) {
                ULL &vB = hash_B[B[i][k]];
                modify(vB, 1);
                vB += c * W[i];
                modify(vB, -1);
            }
        };
        int j = 0;
        F2(i, n) {
            f(i, 1);
            while (cnt)
                f(j++, -1);
            lb[i] = j;
        }
    }
    F2(q_, q) {
        int l, r;
        cin >> l >> r;
        --l, --r;
        cout << (l >= lb[r] ? "Yes\n" : "No\n");
    }
}