#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=200005,M=600005,L=1000005;
int n,m,q,to=1;
int a1[N],a2[N],a3[N];
int b1[N],b2[N],b3[N];
int v1[M],v2[M],b[N];
ll m1,m2,m3,m4,v3[M],v4[M];
mt19937 rnd(555301);
struct node{int l,id;};
vector<node>v[N];
bool vis[L];
void del1(int x){m1-=v1[x];m3^=v3[x];}
void del2(int x){m2-=v2[x];m4^=v4[x];}
void ins1(int x){m1+=v1[x];m3^=v3[x];}
void ins2(int x){m2+=v2[x];m4^=v4[x];}
void qwq1(int x,int y){del1(x);v1[x]^=y;v3[x]+=y;ins1(x);}
void qwq2(int x,int y){del2(x);v2[x]^=y;v4[x]+=y;ins2(x);}
void pwp1(int x,int y){del1(x);v1[x]^=y;v3[x]-=y;ins1(x);}
void pwp2(int x,int y){del2(x);v2[x]^=y;v4[x]-=y;ins2(x);}
int main(){
//	freopen("ex_4.in","r",stdin);
//	freopen("ex_4.out","w",stdout);
	srand(time(0));
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;i++) scanf("%d%d%d",&a1[i],&a2[i],&a3[i]);
	for(int i=1;i<=n;i++) scanf("%d%d%d",&b1[i],&b2[i],&b3[i]);
	for(int i=1;i<=n;i++) b[i]=rnd();
	for(int i=1,x,y;i<=q;i++){
		scanf("%d%d",&x,&y);
		v[y].push_back(node{x,i});
	}
	for(int i=1;i<=n;i++){
		qwq1(a1[i],b[i]);
		qwq1(a2[i],b[i]);
		qwq1(a3[i],b[i]);
		qwq2(b1[i],b[i]);
		qwq2(b2[i],b[i]);
		qwq2(b3[i],b[i]);
		while((to<i)&&((m1!=m2)||(m3!=m4))){
			pwp1(a1[to],b[to]);
			pwp1(a2[to],b[to]);
			pwp1(a3[to],b[to]);
			pwp2(b1[to],b[to]);
			pwp2(b2[to],b[to]);
			pwp2(b3[to],b[to]);
			to++;
		}
		for(node e:v[i])
			vis[e.id]=(to<=e.l);
	}
	for(int i=1;i<=q;i++)
		if(vis[i]) puts("Yes");
		else puts("No");
	return 0;
}