#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int N=2e5+5;
int n,m,q,a[N][3],b[N][3],R[N];
ull s1,s2,val,d[N],A[N*3],B[N*3];
mt19937_64 rnd(time(0));
inline ull calc(ull x){return x<<=5,x>>=7,x^=val,x<<=3,x>>=11;}
inline void add(int x){
    if(x>n)return;
    for(int i:a[x])s1-=calc(A[i]),A[i]+=d[x],s1+=calc(A[i]);
    for(int i:b[x])s2-=calc(B[i]),B[i]+=d[x],s2+=calc(B[i]);
}
inline void del(int x){
    if(x>n)return;
    for(int i:a[x])s1-=calc(A[i]),A[i]-=d[x],s1+=calc(A[i]);
    for(int i:b[x])s2-=calc(B[i]),B[i]-=d[x],s2+=calc(B[i]);
}
signed main(){
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n>>m>>q;
    for(int i=1;i<=n;++i){
        for(int j=0;j<3;++j)cin>>a[i][j];
    }
    for(int i=1;i<=n;++i){
        for(int j=0;j<3;++j)cin>>b[i][j];
    }
    for(int i=1;i<=n;++i)R[i]=n;
    for(int op=1;op<=50;++op){
        val=rnd(),s1=s2=0;
        for(int i=1;i<=n;++i)d[i]=rnd(),A[i]=B[i]=0;
        add(1);
        for(int i=1,j=1;i<=n;++i){
            while(j<=n&&s1==s2)++j,add(j);
            R[i]=min(R[i],j-1),del(i);
        }
    }
    while(q--){
        int l,r;
        cin>>l>>r;
        if(R[l]>=r)cout<<"Yes\n";
        else cout<<"No\n";
    }
    return 0;
}