#include<bits/stdc++.h>
#define lowbit(x) ((x)&-(x))
using namespace std;
mt19937_64 myrand(time(NULL));
using LL=long long;
using uint=unsigned;
using pii=pair<int,int>;
using vi=vector<int>;
using vp=vector<pii>;
template<typename T>inline void read(T&t){
    t=0;
    char c=getchar();
    int f=1;
    while (!isdigit(c)) f=c=='-'?-f:f,c=getchar();
    while (isdigit(c)) t=(t<<3)+(t<<1)+c-'0',c=getchar();
    t*=f;
    return;
}
template<typename T,typename...Args>inline void read(T&t,Args&...args){read(t),read(args...);}
template<typename T>void write(T x){if(x>=10)write(x/10);putchar(x%10+'0');return;}
template<typename T>inline bool chkmax(T&x,T y){return y>x?(x=y,1):0;}
template<typename T>inline bool chkmin(T&x,T y){return y<x?(x=y,1):0;}

const int N=200005;
int n,m,q,a[N][3],b[N][3],maxr[N];
LL val[N][3],nowa[N*3][3],nowb[N*3][3],suma[3],sumb[3];
inline void update(int x) {
    for (int i=0;i<3;i++) {
        for (int j=0;j<3;j++) {
            suma[j]-=nowa[a[x][i]][j],sumb[j]-=nowb[b[x][i]][j];
            nowa[a[x][i]][j]^=val[x][j];
            nowb[b[x][i]][j]^=val[x][j];
            suma[j]+=nowa[a[x][i]][j],sumb[j]+=nowb[b[x][i]][j];
        }
    }
}
int main() {
    read(n,m,q);
    for (int i=1;i<=n;i++) {
        for (int j=0;j<3;j++) read(a[i][j]);
        for (int j=0;j<3;j++) val[i][j]=myrand()&((1ll<<40)-1);
    }
    for (int i=1;i<=n;i++) {
        for (int j=0;j<3;j++) read(b[i][j]);
    }
    int r=0;
    for (int i=1;i<=n;i++) {
        while (1) {
            if (r<n) {
                update(++r);
                if (suma[0]!=sumb[0]||suma[1]!=sumb[1]||suma[2]!=sumb[2]) {
                    update(r--);
                    break;
                }
            } else break;
        }
        maxr[i]=r;
        update(i);
    }
    while (q--) {
        int l,r;
        scanf("%d %d",&l,&r);
        if (r<=maxr[l]) puts("Yes");
        else puts("No");
    }
    return 0;
}