#include<bits/stdc++.h>
#define ll long long 
#define ull unsigned long long 
#define ld double 
using namespace std;
const ll N=2e5+100,M=6e5+100;
inline ll read();
ll a[N][3],b[N][3],mp[M],R[N],msk,q,n,m,T;
ull s1,s2,ap[M],bp[M];
ull rd(ull x)
{
	x=x;
	x=x*1331;
	x=x^msk;
	x=x*13;
	x=x^msk;
	x=x*131;
	return x;
}
void add(ll x,ll w)
{
	for(int i=0;i<=2;i++)
	{
		s1=s1-rd(ap[a[x][i]]);
		ap[a[x][i]]=ap[a[x][i]]+w*mp[x];
		s1=s1+rd(ap[a[x][i]]);
	}
	for(int i=0;i<=2;i++)
	{
		s2=s2-rd(bp[b[x][i]]);
		bp[b[x][i]]=bp[b[x][i]]+w*mp[x];
		s2=s2+rd(bp[b[x][i]]);
	}
}
void solve()
{
	s1=0,s2=0;
	msk=rand(); 
	for(int i=1;i<=n;i++)
	{
		mp[i]=rand()*rand()+rand();
	}
	for(int i=1;i<=m;i++)
	  ap[i]=bp[i]=0;
	add(1,1);
	for(int i=1,j=0;i<=n;add(i,-1),i++)
	{
		while(s1==s2&&j<n)
		{
			j++;
			add(j+1,1);
		}
		R[i]=min(R[i],(ll)j);
	}
	return ;
}
int main()
{
	srand(20090302);
	n=read(),m=read(),q=read();
	for(int i=1;i<=n;i++)  
	  for(int j=0;j<=2;j++) a[i][j]=read();
	for(int i=1;i<=n;i++)
	  for(int j=0;j<=2;j++) b[i][j]=read();
	for(int i=1;i<=n;i++) R[i]=n;
	T=15;
	while(T--)
	  solve();
	ll l,r;
	while(q--)
	{
		l=read(),r=read();
		if(r<=R[l]) printf("Yes\n");
		else printf("No\n"); 
	}
	return 0; 
}
inline ll read()
{
	ll w=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		w=w*10+c-'0';
		c=getchar();
	}
	return w*f;
}