#include <bits/stdc++.h>

using u64 = unsigned long long;

std::mt19937_64 rnd(std::random_device{}());

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int n, m, q;
    std::cin >> n >> m >> q;
    std::vector<std::array<int, 3>> a(n), b(n);
    for (int i = 0; i < n; i++) {
        for (auto &v : a[i]) {
            std::cin >> v;
            v--;
        }
    }
    for (int i = 0; i < n; i++) {
        for (auto &v : b[i]) {
            std::cin >> v;
            v--;
        }
    }
    std::vector<int> ql(q), qr(q);
    std::vector c(n, std::vector<int>());
    for (int i = 0; i < q; i++) {
        std::cin >> ql[i] >> qr[i];
        ql[i]--, qr[i]--;
        c[qr[i]].emplace_back(i);
    }
    int bad = 0;
    std::unordered_map<u64, int> f;
    auto modify = [&](u64 key, int val) {
        if (f[key] != 0) {
            bad--;
        }
        f[key] += val;
        if (f[key] != 0) {
            bad++;
        }
    };
    std::vector<u64> ha(m), hb(m), d(n);
    auto add = [&](int p) {
        for (auto v : a[p]) {
            modify(ha[v], -1);
            ha[v] ^= d[p];
            modify(ha[v], 1);
        }
        for (auto v : b[p]) {
            modify(hb[v], 1);
            hb[v] ^= d[p];
            modify(hb[v], -1);
        }
    };
    std::vector<int> ans(q);
    int l = 0;
    for (int r = 0; r < n; r++) {
        d[r] = rnd();
        add(r);
        while (l <= r && bad) {
            add(l++);
        }
        for (auto i : c[r]) {
            if (ql[i] >= l) {
                ans[i] = 1;
            }
        }
    }
    for (int i = 0; i < q; i++) {
        std::cout << (ans[i] ? "Yes" : "No") << "\n";
    }
    return 0;
}