#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define N 1000005
using namespace std;
const int inf=1e9;
int n,m,q;
ull h[N];
ull shift(ull x)
{
	x+=114514;
	x^=(x<<7);
	x*=1919810;
	x^=(x>>11);
	x^=(x<<13);
	x^=(x>>8);
	return x;
}
int a[N][3],b[N][3];
int res[N];
ull suma[N],sumb[N];
ull ra,rb;
void modify(int x,ull w)
{
	for(int i=1;i<=3;i++)
	{
		ra-=shift(suma[a[x][i]]);
		rb-=shift(sumb[b[x][i]]);
		suma[a[x][i]]+=shift(x)*w,
		sumb[b[x][i]]+=shift(x)*w;
		ra+=shift(suma[a[x][i]]);
		rb+=shift(sumb[b[x][i]]);
	}
}
int main()
{
//	freopen("ex_3.in","r",stdin);
//	freopen("m.txt","w",stdout);
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=3;j++) scanf("%d",&a[i][j]); 
	for(int i=1;i<=n;i++)
		for(int j=1;j<=3;j++) scanf("%d",&b[i][j]); 
	int l=1,r=0;
	for(l=1;l<=n;l++)
	{
		while(r<=n)
		{
			if(ra^rb) break;
			modify(++r,1);
		}
		modify(l,-1);
		res[l]=r-1;
	}
	while(q--)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		printf(res[u]>=v?"Yes\n":"No\n");
	}
	return 0;
}