#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll B1=600007;
const ll P1=998244353;
const ll P2=1000000007;
const int N=600009;
const int M=600009;
int n,m,q,bst[N];
ll s[M],t[M],sum1=1,sum2=1;
struct Set{int x,y,z;} a[N],b[N];
ll ksm(ll a,ll b,ll c){
	ll ans=1;
	while(b){
		if(b&1)ans=ans*a%c;
		a=a*a%c;
		b>>=1;
	}
	return ans;
}
ll inv(ll a,ll b){
	return ksm(a,b-2,b);
}
void insert1(int x,int i){
	sum1=sum1*inv(s[x],P2)%P2;
	assert(s[x]%P2!=0);
	(s[x]+=ksm(B1,i,P1))%=P1;
	sum1=sum1*s[x]%P2;
}
void insert2(int x,int i){
	sum2=sum2*inv(t[x],P2)%P2;
	assert(t[x]%P2!=0);
	(t[x]+=ksm(B1,i,P1))%=P1;
	sum2=sum2*t[x]%P2;
}
void delete1(int x,int i){
	sum1=sum1*inv(s[x],P2)%P2;
	assert(s[x]%P2!=0);
	(s[x]=s[x]-ksm(B1,i,P1)+P1)%=P1;
	sum1=sum1*s[x]%P2;
}
void delete2(int x,int i){
	sum2=sum2*inv(t[x],P2)%P2;
	assert(t[x]%P2!=0);
	(t[x]=t[x]-ksm(B1,i,P1)+P1)%=P1;
	sum2=sum2*t[x]%P2;
}
int main(){
	scanf("%d%d%d",&n,&m,&q);
	sum1=sum2=1;
	for(int i=1;i<=n;i++)
	    scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
	for(int i=1;i<=n;i++)
	    scanf("%d%d%d",&b[i].x,&b[i].y,&b[i].z);
	for(int i=1;i<=n*3;i++)
	    s[i]=t[i]=1;
	int r=0;
	for(int l=1;l<=n;l++){
		bst[l]=max(bst[l-1],l);
		if(sum1==sum2)bst[l]=max(bst[l],r);
		while((sum1==sum2||r<l)&&r<=n-1){
			r++;
			insert1(a[r].x,r);
			insert1(a[r].y,r);
			insert1(a[r].z,r);
			insert2(b[r].x,r);
			insert2(b[r].y,r);
			insert2(b[r].z,r);
			if(sum1!=sum2)break;
			bst[l]=r;
		}
		delete1(a[l].x,l);
		delete1(a[l].y,l);
		delete1(a[l].z,l);
		delete2(b[l].x,l);
		delete2(b[l].y,l);
		delete2(b[l].z,l);
	}
	int ql,qr;
	for(int i=1;i<=q;i++){
		scanf("%d%d",&ql,&qr);
		if(bst[ql]>=qr)puts("Yes");
		else puts("No");
	}
	return 0;
}