#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
#define ull unsigned long long
ull seed=19730619;
ull ran(){
	seed^=seed<<13;
	seed^=seed>>7;
	seed^=seed<<17;
	return seed;
}
ull rd[200005];
__gnu_pbds::cc_hash_table<ull,int>m1,m2;
int rt[200005];
int a[200005][3],b[200005][3];
ull ha[600005],hb[600005];
int cj=0;
void add(int x){
	for(int i=0;i<3;++i){
		int z=a[x][i];
		int g1=m1[ha[z]],g2=m2[ha[z]];
		--m1[ha[z]];cj+=abs(g1-1-g2)-abs(g1-g2);
		ha[z]^=rd[x];
		int h1=m1[ha[z]],h2=m2[ha[z]];
		++m1[ha[z]];cj+=abs(h1+1-h2)-abs(h1-h2);
	}
	for(int i=0;i<3;++i){
		int z=b[x][i];
		int g1=m2[hb[z]],g2=m1[hb[z]];
		--m2[hb[z]];cj+=abs(g1-1-g2)-abs(g1-g2);
		hb[z]^=rd[x];
		int h1=m2[hb[z]],h2=m1[hb[z]];
		++m2[hb[z]];cj+=abs(h1+1-h2)-abs(h1-h2);
	}
}
void del(int x){
	for(int i=0;i<3;++i){
		int z=a[x][i];
		int g1=m1[ha[z]],g2=m2[ha[z]];
		--m1[ha[z]];cj+=abs(g1-1-g2)-abs(g1-g2);
		ha[z]^=rd[x];
		int h1=m1[ha[z]],h2=m2[ha[z]];
		++m1[ha[z]];cj+=abs(h1+1-h2)-abs(h1-h2);
	}
	for(int i=0;i<3;++i){
		int z=b[x][i];
		int g1=m2[hb[z]],g2=m1[hb[z]];
		--m2[hb[z]];cj+=abs(g1-1-g2)-abs(g1-g2);
		hb[z]^=rd[x];
		int h1=m2[hb[z]],h2=m1[hb[z]];
		++m2[hb[z]];cj+=abs(h1+1-h2)-abs(h1-h2);
	}
}
int main(){
	int n,m,q;
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;++i)rd[i]=ran();
	for(int i=1;i<=n;++i)for(int j=0;j<3;++j)scanf("%d",&a[i][j]);
	for(int i=1;i<=n;++i)for(int j=0;j<3;++j)scanf("%d",&b[i][j]);
	m1[0]=m2[0]=n;
	int r=1;
	add(r);
	for(int l=1;l<=n;++l){
		while(r<=n&&cj==0){
			++r;
			if(r<=n)add(r);
		}
		rt[l]=r-1;
		del(l);
	}
	while(q--){
		int l,r;
		scanf("%d%d",&l,&r);
		puts(rt[l]>=r?"Yes":"No");
	}
	return 0;
}