#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1.2e6+9;
int to[N];
int rd[N];
unsigned long long sum[N],sum1,sum2;
int a[N][3],b[N][3];
int n,m,q;
int f(int x)
{
	return x*x%998244353*x%998244353+x*1231%9982433+7;
}
bool check(int x)
{
	unsigned long long nows1=sum1,nows2=sum2;
	for(int j=0;j<3;j++)
	{
		nows1-=f(sum[a[x][j]]);
		nows1+=f(sum[a[x][j]]+rd[x]);
		nows2-=f(sum[b[x][j]]);
		nows2+=f(sum[b[x][j]]+rd[x]);
	}
	return nows1==nows2;
}
void add(int x)
{
	for(int j=0;j<3;j++)
	{
		sum1-=f(sum[a[x][j]]);
		sum[a[x][j]]+=rd[x];
		sum1+=f(sum[a[x][j]]);
		sum2-=f(sum[b[x][j]]);
		sum[b[x][j]]+=rd[x];
		sum2+=f(sum[b[x][j]]);
	}
}
void del(int x)
{
	for(int j=0;j<3;j++)
	{
		sum1-=f(sum[a[x][j]]);
		sum[a[x][j]]-=rd[x];
		sum1+=f(sum[a[x][j]]);
		sum2-=f(sum[b[x][j]]);
		sum[b[x][j]]-=rd[x];
		sum2+=f(sum[b[x][j]]);
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	// freopen("ex_4.in","r",stdin);
	// freopen("1.out","w",stdout);
	cin>>n>>m>>q;
	for(int i=1;i<=n;i++)
	{
		rd[i]=rd[i+n]=i*1145141%1919810;
		sum1+=f(0);
		sum2+=f(0);
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<3;j++)
		cin>>a[i][j];
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<3;j++)
		{
			cin>>b[i][j];
			b[i][j]+=m;
		}
	}
	int r=1;
	for(int l=1;l<=n;l++)
	{
		while(r<=n&&check(r))
		{
			add(r);
			r++;
		}
		to[l]=r-1;
		del(l);
		if(r<=l)
		r=l+1;
	}
	while(q--)
	{
		int l,r;
		cin>>l>>r;
		if(to[l]>=r)
		{
			cout<<"Yes\n";
		}
		else
		{
			cout<<"No\n";
		}
	}
	return 0;
}