#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=6e5+10,mod=1e9+7,p=1e5+7;
int n,m,q,a[N],b[N],la[N],lb[N],ya[N],yb[N],id[N],x,y,mi[N];
int ksm(int x,int y){
	int rt=1;
	while(y){
		if(y&1) rt=rt*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return rt;
}
int inv(int t){
	if(t==0) return 1;
	return ksm(t,mod-2);
}
void adda(int pl,int t){
	la[t]++;
	x=x*inv(ya[t])%mod;
	ya[t]=ya[t]*p+pl;
	ya[t]%=mod;
	x=x*ya[t]%mod;
}
void addb(int pl,int t){
	lb[t]++;
	y=y*inv(yb[t])%mod;
	yb[t]=yb[t]*p+pl;
	yb[t]%=mod;
	y=y*yb[t]%mod;
}
void dela(int pl,int t){
	la[t]--;
//	cout<<"t "<<t<<" "<<ya[t]<<" ";
	x=x*inv(ya[t])%mod;
	ya[t]=ya[t]-mi[la[t]]*pl%mod;
	ya[t]=(ya[t]%mod+mod)%mod;
//	cout<<ya[t]<<endl;
	if(ya[t]!=0) x=x*ya[t]%mod;
}
void delb(int pl,int t){
	lb[t]--;
//	cout<<"bt "<<t<<" "<<yb[t]<<" ";
	y=y*inv(yb[t])%mod;
	yb[t]=yb[t]-mi[lb[t]]*pl%mod;
	yb[t]=(yb[t]%mod+mod)%mod;
//	cout<<yb[t]<<endl;
	if(yb[t]!=0) y=y*yb[t]%mod;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n>>m>>q;
	mi[0]=1;
	for(int i=1;i<=n;i++) mi[i]=mi[i-1]*p%mod;
//	for(int i=0;i<=m;i++) ya[i]=yb[i]=1;
	x=y=1;
	for(int i=1;i<=3*n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=3*n;i++){
		cin>>b[i];
	}
	int l=1,r=0;
	while(l<=n){
		int fl=0;
		while(r<=n){
			r++;
			if(r==n+1){
				for(int j=l;j<=n;j++){
					id[j]=n+1;
				}
				fl=1;
				break;
			}
			adda(r,a[r*3-2]);
			adda(r,a[r*3-1]);
			adda(r,a[r*3]);
			addb(r,b[r*3-2]);
			addb(r,b[r*3-1]);
			addb(r,b[r*3]);
		//	cout<<"xy "<<l<<" "<<r<<" "<<x<<" "<<y<<endl;
			if(x==y) continue;
			else{
				id[l]=r;
				break;
			}
		}
		if(fl==1) break;
		while(l<=r){
			dela(l,a[l*3-2]);
			dela(l,a[l*3-1]);
			dela(l,a[l*3]);
			delb(l,b[l*3-2]);
			delb(l,b[l*3-1]);
			delb(l,b[l*3]);
			l++;
		//	cout<<"lr "<<l<<" "<<r<<" "<<x<<" "<<y<<endl;
			if(x==y) break;
			else{
				id[l]=r;
			}
		}
	}
/*	for(int i=1;i<=n;i++){
		cout<<"id "<<i<<" "<<id[i]<<endl;
	}*/
	while(q--){
		int l,r;
		cin>>l>>r;
		if(id[l]<=r) cout<<"No"<<endl;
		else cout<<"Yes"<<endl;
	}
	return 0;
}