#include <bits/stdc++.h>
#define u64 unsigned long long

using namespace std;

const int N = 2e5 + 5, M = 3 * N, P = 2e5 + 7;

int n, m, q, a[2][N][3], f[N];
u64 h[2][M], Pw[N];
vector <int> com[2];

bool check(int id){
    for (int t = 0; t < 2; ++ t){
        com[t] = {};
        for (int i = 0; i < 3; ++ i) com[t].push_back(h[t][a[t][id][i]]);
        sort(com[t].begin(), com[t].end());
    }
    for (int i = 0; i < 3; ++ i) if (com[0][i] != com[1][i]) return false;
    return true;
}

void add(int id, int v){
    for (int t = 0; t < 2; ++ t){
        for (int i = 0; i < 3; ++ i) h[t][a[t][id][i]] += (Pw[id] * v);
    }
}

void solve(){
    cin >> n >> m >> q;
    for (int i = 1; i <= n; ++ i) for (int j = 0; j < 3; ++ j) cin >> a[0][i][j];
    for (int i = 1; i <= n; ++ i) for (int j = 0; j < 3; ++ j) cin >> a[1][i][j];
    Pw[0] = 1;
    for (int i = 1; i <= n; ++ i) Pw[i] = Pw[i - 1] * P;

    for (int i = 1, j = 1; i <= n; ++ i){
        while (j <= n && check(j)){
            add(j, 1);
            ++ j;
        }
        f[i] = j - 1;
        add(i, -1);
    }

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

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

    solve();

    return 0;
}