#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N=2e5+10,M=6e5+10;
int a[3][N],b[3][N];
ull to[N],A[M],B[M];
mt19937 rd(time(0));
int pos[N];
int add(int p){
    for(int i=0;i<3;i++)A[a[i][p]]+=to[p],B[b[i][p]]+=to[p];
    vector<int>t1,t2;
    for(int i=0;i<3;i++){
        t1.push_back(A[a[i][p]]),t2.push_back(B[b[i][p]]);
        // cout<<A[a[i][p]]<<" "<<B[b[i][p]]<<"\n";
    }
    sort(t1.begin(),t1.end());sort(t2.begin(),t2.end());
    for(int i=0;i<3;i++)if(t1[i]^t2[i])return 1;
    return 0;
}
void del(int p){
    for(int i=0;i<3;i++)A[a[i][p]]-=to[p],B[b[i][p]]-=to[p];
}
int main() {
    // freopen("ex_4.in","r",stdin);
    // freopen("3.out","w",stdout);
    int n,m,Q;scanf("%d%d%d",&n,&m,&Q);
    for(int i=1;i<=n;i++){
        to[i]=rd();
        for(int j=0;j<3;j++)scanf("%d",&a[j][i]);
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<3;j++)scanf("%d",&b[j][i]);
    }
    for(int i=1,r=0;i<=n;i++){
        while(r<n){
            r++;
            if(r>n)break;
            if(add(r)){
                del(r);r--;
                break;
            }
        }
        pos[i]=r;
        del(i);
    }
    while(Q--){
        int l,r;scanf("%d%d",&l,&r);
        if(pos[l]>=r)printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}