#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll MOD = 1e9 + 7;

ll pw(ll b, ll e) {
    ll r = 1;
    while (e) {
        if (e & 1) {
            r = r * b % MOD;
        }
        b = b * b % MOD;
        e >>= 1;
    }
    return r;
}

ll inv(ll b) { return pw(b, MOD - 2); }

const int MAX_N = 2e5 + 5, MAX_M = 6e5 + 5;
vector<int> cs[2];
ll tot_hash[2] = {1, 1};
ll mask_hash[2][MAX_M];
ll pow2[MAX_N];

void sub_tot(ll &tot, ll mask) {
    tot *= inv(mask + 1);
    tot %= MOD;
}

void add_tot(ll &tot, ll mask) {
    tot *= mask + 1;
    tot %= MOD;
}

void toggle_idx(int idx, bool add) {
    for (int k = 0; k < 3; k++) {
        for (int t = 0; t < 2; t++) {
            int val = cs[t][3 * idx + k];
            ll &mask = mask_hash[t][val];
            sub_tot(tot_hash[t], mask);
            mask += add ? pow2[idx] : MOD - pow2[idx];
            if (mask >= MOD) {
                mask -= MOD;
            }
            add_tot(tot_hash[t], mask);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m, q;
    cin >> n >> m >> q;
    pow2[0] = 1;
    for (int i = 1; i < n; i++) {
        pow2[i] = pow2[i - 1] << 1;
        if (pow2[i] >= MOD) {
            pow2[i] -= MOD;
        }
    }
    for (int t = 0; t < 2; t++) {
        cs[t].resize(3 * n);
        for (int &c : cs[t]) {
            cin >> c;
        }
    }
    vector<int> max_r(n);
    int r_ptr = 0;
    for (int i = 0; i < n; i++) {
        while (r_ptr < n && tot_hash[0] == tot_hash[1]) {
            toggle_idx(r_ptr++, true);
        }
        if (tot_hash[0] != tot_hash[1]) {
            toggle_idx(--r_ptr, false);
        }
        max_r[i] = r_ptr;
        toggle_idx(i, false);
    }
    for (int qi = 0; qi < q; qi++) {
        int a, b;
        cin >> a >> b;
        cout << (max_r[a - 1] >= b ? "Yes\n" : "No\n");
    }

    return 0;
}