#include<bits/stdc++.h>

#define mo(x, y) ((((x)%P##y)+P##y)%P##y)
#define qmi2(x) (pb3[x/L]*pb2[x%L]%P2)

using namespace std;

void read(int &x){
    x = 0;
    char c = getchar();
    while(c < '0'|| c > '9') c = getchar();
    while('0' <= c && c <= '9'){
        x = x*10+c-'0';
        c = getchar();
    }
}

long long qmi(long long qa, long long qb, long long qc){
    long long qans = 1;
    while(qb){
        if(qb & 1) qans = qans * qa % qc;
        qa = qa * qa % qc;
        qb >>= 1;
    }
    return qans;
}

const int N = 2e5 + 5, M = 6e5 + 5, Q = 1e6 + 5;
const int B1 = 131, P1 = 998244353;
const int B2 = 13331, P2 = 1e9+7;
const int L = 5e4;

int n, m, q;
int a[N][3];
int b[N][3];
int maxl[N];

long long pha[M], phb[M];
long long hsha, hshb;

long long pb1[N];
long long pb2[L], pb3[L];

void add(int x){
    for(int i = 0; i < 3; i++){
        hsha = mo(hsha-qmi2(pha[a[x][i]]), 2);
        pha[a[x][i]] = mo(pha[a[x][i]]+pb1[x], 1);
        hsha = mo(hsha+qmi2(pha[a[x][i]]), 2);
        hshb = mo(hshb-qmi2(phb[b[x][i]]), 2);
        phb[b[x][i]] = mo(phb[b[x][i]]+pb1[x], 1);
        hshb = mo(hshb+qmi2(phb[b[x][i]]), 2);
    }
}

void del(int x){
    for(int i = 0; i < 3; i++){
        hsha = mo(hsha-qmi2(pha[a[x][i]]), 2);
        pha[a[x][i]] = mo(pha[a[x][i]]-pb1[x], 1);
        hsha = mo(hsha+qmi2(pha[a[x][i]]), 2);
        hshb = mo(hshb-qmi2(phb[b[x][i]]), 2);
        phb[b[x][i]] = mo(phb[b[x][i]]-pb1[x], 1);
        hshb = mo(hshb+qmi2(phb[b[x][i]]), 2);
    }
}

bool check(){
    return hsha == hshb;
}

int main(){

    pb1[0] = 1;
    for(int i = 1; i < N; i++){
        pb1[i] = pb1[i-1] * B1 % P1;
    }
    pb2[0] = 1;
    for(int i = 1; i < L; i++){
        pb2[i] = pb2[i-1] * B2 % P2;
    }
    pb3[0] = 1; pb3[1] = pb2[L-1] * B2 % P2;
    for(int i = 1; i < L; i++){
        pb3[i] = pb3[i-1] * pb3[1] % P2;
    }

    read(n); read(m); read(q);
    for(int i = 1; i <= n; i++){
        read(a[i][0]); read(a[i][1]); read(a[i][2]);
    }
    for(int i = 1; i <= n; i++){
        read(b[i][0]); read(b[i][1]); read(b[i][2]);
    }

    hsha = hshb = m;

    for(int l = 1, r = 0; l <= n; ){
        while(r < n){
            add(++r);
            if(!check()){
                del(r--);
                break;
            }
        }
        maxl[l] = r;
        del(l++);
    }

    int x = 0, y = 0;
    while(q--){
        read(x); read(y);
        if(y <= maxl[x]){
            puts("Yes");
        }else{
            puts("No");
        }
    }

    return 0;
}