#include<bits/stdc++.h>

#define ll unsigned long long
#define pi pair<ll,ll>
#define fi first
#define se second
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mem(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define vi vector<ll> 
#define arr array
#define pb push_back
#define mp make_pair

using namespace std;

#define N 2000005

ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(ll x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

ll p[N],a[N][4],b[N][4],val[N];
ll res[N];

vector<pi> Q[N];
unordered_map<ll,ll> t;

ll sum=0,cnt=0;
mt19937_64 rnd(114514);

void add(ll v,ll pos){cnt++;
    if(t[val[v]]==1)sum--;
    if(t[val[v]]==0)sum++;
    t[val[v]]--;
    val[v]^=p[pos];
    t[val[v]]++;
    if(t[val[v]]==0)sum--;
    if(t[val[v]]==1)sum++;
}
void del(ll v,ll pos){cnt++;
    if(t[val[v]]==0)sum++;
    if(t[val[v]]==-1)sum--;
    t[val[v]]++;
    val[v]^=p[pos];
    t[val[v]]--;
    if(t[val[v]]==0)sum--;
    if(t[val[v]]==-1)sum++;
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    #endif
    ll n=read(),m=read(),q=read();
    for(ll i=1;i<=n;i++)p[i]=rnd();
    for(ll i=1;i<=n;i++)for(ll j=1;j<=3;j++)a[i][j]=read();
    for(ll i=1;i<=n;i++)for(ll j=1;j<=3;j++)b[i][j]=read();
    for(ll i=1;i<=q;i++){
        ll l=read(),r=read();
        Q[r].push_back(mp(i,l));
    }
    ll l=1;
    for(ll i=1;i<=n;i++){
        for(ll j=1;j<=3;j++)add(a[i][j],i),del(b[i][j]+m,i);
        while(sum!=0){
            for(ll j=1;j<=3;j++)add(a[l][j],l),del(b[l][j]+m,l);
            l++;
        }
        if(clock()*1.0/CLOCKS_PER_SEC*1000>900){assert(l<=i);break;}
        for(auto [id,L]:Q[i])if(L>=l)res[id]=1;
    }
    for(ll i=1;i<=q;i++){
        if(res[i])printf("Yes\n");
        else printf("No\n");
    }
}