#include<bits/stdc++.h>
#define ll long long
#define F(i,l,r) for(int i=(l),i##end=(r);i<=i##end;++i)
#define G(i,l,r) for(int i=(l),i##end=(r);i>=i##end;--i)
#define x first
#define y second
#define int long long
#define pii pair<int,int>
#define mp(x,y) make_pair(x,y)
#define ep emplace_back
using namespace std;
int base=1233,m,q,qp[600009],has[12000009],mod=1e18+3;
unordered_map<ll,int> ma;mt19937_64 rnd(time(0));
int f[200009];int err;
vector<int> a[200009],b[200009];
void add(int i)
{
  	for(auto u:a[i])
	{
	  	err-=ma[has[u]]==1;
		err+=ma[has[u]]==0;
		ma[has[u]]--;
		has[u]^=qp[i];
		err+=ma[has[u]]==0;
		err-=ma[has[u]]==-1;
		ma[has[u]]++;
	}
	for(auto u:b[i])
	{
	  	err-=ma[has[u+m]]==-1;
		err+=ma[has[u+m]]==0;
		ma[has[u+m]]++;
		has[u+m]^=qp[i];
		err+=ma[has[u+m]]==0;
		err-=ma[has[u+m]]==1;
		ma[has[u+m]]--;
	}
}
main()
{
  	int n;
	cin>>n>>m>>q;
	qp[0]=1;
	F(i,1,n) qp[i]=rnd();
	F(i,1,n)F(j,0,2){int x;cin>>x;a[i].ep(x);}
	F(i,1,n)F(j,0,2){int x;cin>>x;b[i].ep(x);}
	F(i,1,n)
	{
	  	f[i]=f[i-1];
		add(i);
		while(err && f[i]<i) add(++f[i]);
	}
	F(i,1,q)
	{
		int l,r;
		cin>>l>>r;
		if(l>f[r]) cout<<"Yes\n";
		else cout<<"No\n";
	}
}