#include<bits/stdc++.h>
using namespace std;
#define max_n 600000
#define mod 998244353ll
mt19937 rnd(998244353);
long long ba[max_n+2];
int n;
int m;
int q;
int a[max_n+2][3];
int b[max_n+2][3];
long long cnta1[max_n+2]; 
long long cntb1[max_n+2];
long long cnta2[max_n+2]; 
long long cntb2[max_n+2];
long long suma1=1,sumb1=1,suma2=1,sumb2=1;
int pos[max_n+2];
inline long long askrnd(){
	return (1ll*(rnd()%1000000ll)*1000000ll+(rnd()%1000000ll))%998244352ll+1;
}
inline long long qp(long long a,long long b){
	long long res=1;
	while(b){
		if(b&1)res=res*a%mod;
		a=a*a%mod; b>>=1;
	}
	return res;
}
inline void adda(int x,int y){
	suma1=suma1*qp(cnta1[x],mod-2)%mod;
	cnta1[x]=(cnta1[x]+ba[y])%mod;
	suma1=suma1*cnta1[x]%mod;
	suma2=suma2*qp(cnta2[x],mod-2)%mod;
	cnta2[x]=(cnta2[x]+ba[y+n])%mod;
	suma2=suma2*cnta2[x]%mod;
}
inline void addb(int x,int y){
	sumb1=sumb1*qp(cntb1[x],mod-2)%mod;
	cntb1[x]=(cntb1[x]+ba[y])%mod;
	sumb1=sumb1*cntb1[x]%mod;
	sumb2=sumb2*qp(cntb2[x],mod-2)%mod;
	cntb2[x]=(cntb2[x]+ba[y+n])%mod;
	sumb2=sumb2*cntb2[x]%mod;
}
inline void dela(int x,int y){
	suma1=suma1*qp(cnta1[x],mod-2)%mod;
	cnta1[x]=(cnta1[x]-ba[y]+mod)%mod;
	suma1=suma1*cnta1[x]%mod;
	suma2=suma2*qp(cnta2[x],mod-2)%mod;
	cnta2[x]=(cnta2[x]-ba[y+n]+mod)%mod;
	suma2=suma2*cnta2[x]%mod;
}
inline void delb(int x,int y){
	sumb1=sumb1*qp(cntb1[x],mod-2)%mod;
	cntb1[x]=(cntb1[x]-ba[y]+mod)%mod;
	sumb1=sumb1*cntb1[x]%mod;
	sumb2=sumb2*qp(cntb2[x],mod-2)%mod;
	cntb2[x]=(cntb2[x]-ba[y+n]+mod)%mod;
	sumb2=sumb2*cntb2[x]%mod;
}
int main(){
	#ifndef ONLINE_JUDGE
	freopen("P10785_1.in","r",stdin);
	freopen("P10785_1.out","w",stdout);
	#endif
	for(int i=1;i<=max_n;++i)ba[i]=askrnd();
	unique(ba+1,ba+max_n+1);
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;++i){
		for(int j=0;j<=2;++j)scanf("%d",a[i]+j);
	}
	for(int i=1;i<=n;++i){
		for(int j=0;j<=2;++j)scanf("%d",b[i]+j);
	}
	for(int i=1;i<=m;++i)cnta1[i]=cntb1[i]=cnta2[i]=cntb2[i]=1;
	for(int i=1;i<=n;++i)pos[i]=i;
	for(int l=1,r=0;l<=n;){
		if(suma1==sumb1&&suma2==sumb2){
			pos[l]=max(pos[l],r++);
			if(r>n)break;
			for(int j=0;j<=2;++j){adda(a[r][j],r); addb(b[r][j],r);}
		}
		else{
			for(int j=0;j<=2;++j){dela(a[l][j],l); delb(b[l][j],l);}
			++l;
		}
	}
	for(int i=2;i<=n;++i)pos[i]=max(pos[i],pos[i-1]);
	for(int ca=1,l,r;ca<=q;++ca){
		scanf("%d%d",&l,&r);
		if(pos[l]>=r)printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}