#include <bits/stdc++.h>

using namespace std;
using ll = long long;

using ar = array<int, 3>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, q;
    cin >> n >> m >> q;

    vector<ar> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        for (auto &f : a[i]) {
            cin >> f;
            --f;
        }
    }
    for (int i = 0; i < n; ++i) {
        for (auto &f : b[i]) {
            cin >> f;
            --f;
        }
    }

    struct Struct {
        vector<int> cnt;
        map<pair<int, int>, int> mp;

        void init(int k) {
            cnt.assign(k, 0);
        }

        void modify(ar a, ar b, int mod) {
            for (int &x : a) {
                cnt[x] += mod;
            }
            for (int x : a) {
                for (int y : b) {
                    mp[{x, y}] += mod;
                }
            }
        }

        int check(ar a, ar b) {
            ar adj{};
            for (int i = 0; i < 3; ++i) {
                int need = cnt[a[i]];
                for (int j = 0; j < 3; ++j) {
                    if (mp[{a[i], b[j]}] == need) {
                        adj[i] |= 1 << j;
                    }
                }
            }
            for (int mask = 1; mask < (1 << 3); ++mask) {
                int now = 0;
                for (int i = 0; i < 3; ++i) {
                    if (mask >> i & 1) {
                        now |= adj[i];
                    }
                }
                if (__builtin_popcount(mask) > __builtin_popcount(now)) {
                    return false;
                }
            }
            return true;
        }
    } A, B;
    A.init(m), B.init(m);

    vector<int> mxr(n + 1, n);
    for (int i = n - 1; i >= 0; --i) {
        mxr[i] = mxr[i + 1];
        A.modify(a[i], b[i], 1);
        B.modify(b[i], a[i], 1);
        while (mxr[i] > i && (!A.check(a[i], b[i]) || !B.check(b[i], a[i]))) {
            mxr[i] -= 1;
            A.modify(a[mxr[i]], b[mxr[i]], -1);
            B.modify(b[mxr[i]], a[mxr[i]], -1);
        }
    }

    while (q--) {
        int l, r;
        cin >> l >> r;
        --l;
        if (mxr[l] >= r) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }

    return 0;
}