#include<bits/stdc++.h>
#define endl '\n'
#define ull unsigned long long
using namespace std;
const int P=10007;
int n,m,q;
int p[22][200005],vst[2][600005];
ull HS[2],pw[200005],hs[2][600005];
struct node{int a,b,c;}a[200005],b[200005];
mt19937 rd(time(0));
unordered_map<ull,ull>g;
inline ull H(ull val){
	if(g.find(val)!=g.end())return g[val];
	return g[val]=((ull)rd()<<32)+rd();
}
inline void ins(int x,int id,int k,int op){
	if(vst[op][x])HS[op]-=H(hs[op][x]);
	hs[op][x]+=pw[id]*k,vst[op][x]+=k;
	if(vst[op][x])HS[op]+=H(hs[op][x]);
}
inline void add(int x,int k){
	ins(a[x].a,x,k,0),ins(a[x].b,x,k,0),ins(a[x].c,x,k,0);
	ins(b[x].a,x,k,1),ins(b[x].b,x,k,1),ins(b[x].c,x,k,1);
}
inline int ask(int l,int r){
	int k=__lg(r-l+1);
	return min(p[k][l],p[k][r-(1<<k)+1]);
}
signed main(){
	#ifndef ONLINE_JUDGE
	freopen("ex_4.in","r",stdin);
	freopen(".out","w",stdout);
	#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m>>q,pw[0]=1;
	for(int i=1;i<=n;i++)cin>>a[i].a>>a[i].b>>a[i].c,pw[i]=pw[i-1]*P;
	for(int i=1;i<=n;i++)cin>>b[i].a>>b[i].b>>b[i].c;
	for(int i=1,j=0;i<=n;i++){
		while(j<=n&&HS[0]==HS[1])add(++j,1);
		assert(i<=j);
		p[0][i]=j-1,add(i,-1);
	}
	for(int j=1;(1<<j)<=n;j++){
		for(int i=1;i+(1<<j)-1<=n;i++){
			p[j][i]=min(p[j-1][i],p[j-1][i+(1<<j-1)]);
		}
	}
	while(q--){
		int l,r;cin>>l>>r;
		cout<<(ask(l,r)>=r?"Yes":"No")<<endl;
	}
	return 0;
}