#include<cstdio>
#include<algorithm>
#include<unordered_map>
//#define getchar getchar_unlocked
//#define putchar putchar_unlocked
template<typename T>void read(T &x){
	x=0;bool f=0;char ch=getchar();
	for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=1;
	for(;ch>='0'&&ch<='9';ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	if(f)x=-x;
}
void write(char x){putchar(x);}
template<typename T>void write(T x){
	if(x<0)putchar('-'),x=-x;
	char stk[104];int cnt=0;
	do stk[++cnt]=x%10+48,x/=10;while(x);
	for(;cnt;)putchar(stk[cnt--]);
}
template<typename T,typename ...Args>void read(T &x,Args &...args){read(x);read(args...);}
template<typename T,typename ...Args>void write(T x,Args ...args){write(x);write(args...);}
template<typename T>T min(T x,T y){return x<y?x:y;}
template<typename T>T max(T x,T y){return x>y?x:y;}
const int maxn=6e5+4,P=19491001;int n,m,q,ans[maxn],tot;std::unordered_map<unsigned long long,int>mp;
unsigned long long hash[2][maxn],pw[12*maxn],H[2];
struct _{int x,y,z;}a[maxn],b[maxn];
void change(int x,int loc,bool op,int val){
	unsigned long long &tmp=hash[op][x];
	if(tmp&&mp.find(tmp)!=mp.end())H[op]-=pw[mp[tmp]];
	unsigned long long shi=pw[loc]*val;
	tmp+=shi;
	if(tmp&&mp.find(tmp)==mp.end())mp[tmp]=++tot;
	if(tmp)H[op]+=pw[mp[tmp]];
}
void work(int i,int op){
	change(a[i].x,i,0,op),change(b[i].x,i,1,op),
	change(a[i].y,i,0,op),change(b[i].y,i,1,op),
	change(a[i].z,i,0,op),change(b[i].z,i,1,op);
}
signed main(){
	read(n,m,q);pw[0]=1;
	for(int i=1;i<=12*n;++i)pw[i]=pw[i-1]*P;
	for(int i=1;i<=n;++i)read(a[i].x,a[i].y,a[i].z);
	for(int i=1;i<=n;++i)read(b[i].x,b[i].y,b[i].z);
	for(int l=1,r=0;l<=n;){
		for(;r<l;)++r,work(r,1);
		for(;r<=n&&H[0]==H[1];)r++,work(r,1);
		work(r,-1);r--;ans[l]=r;work(l,-1);l++;
	}
	for(;q--;){
		int x,y;read(x,y);
		puts(ans[x]>=y?"Yes":"No");
	}
	return 0;
}