#include<bits/stdc++.h>
#define pow power
#define ull unsigned long long
using namespace std;
template<typename T>void read(T &x)
{
	x=0;int f=1;
	char c=getchar();
	for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
	for(;isdigit(c);c=getchar()) x=(x<<3)+(x<<1)+c-'0';
	x=x*f;
}
template<typename T>void write(T x)
{
	if(x<0)
	{
		putchar('-');
		write(-x);
		return ;
	}
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
const int N=1e7+5;
const ull p=13337;
ull get(ull x)
{
	return x*x*x;
}
ull pw[N];
int a[N][3],b[N][3];
int rp[N];
ull ta[N],tb[N];
ull suma,sumb;
void solve(int id,int fl)
{
	for(int i=0;i<3;i++)
	{
		suma-=get(ta[a[id][i]]);
		ta[a[id][i]]+=fl*pw[id];
		suma+=get(ta[a[id][i]]);
		sumb-=get(tb[b[id][i]]);
		tb[b[id][i]]+=fl*pw[id];
		sumb+=get(tb[b[id][i]]);
	}
}
int main()
{
	int n,m,q;
	read(n);read(m);read(q);
	for(int i=1;i<=n;i++)
		for(int j=0;j<3;j++)
			read(a[i][j]);
	for(int i=1;i<=n;i++)
		for(int j=0;j<3;j++)
			read(b[i][j]);
	pw[0]=1;
	for(int i=1;i<=n;i++) pw[i]=pw[i-1]*p;
	int r=0;
	for(int l=1;l<=n;l++)
	{
		while(suma==sumb&&r<=n)
		{
			solve(r+1,1);
			r++;
		}
		rp[l]=r-1;
		solve(l,-1);
	}
	while(q--)
	{
		int l,r;
		read(l);read(r);
		if(r<=rp[l]) puts("Yes");
		else puts("No");
	}
	return 0;
}