#include<bits/stdc++.h>
#define ull unsigned long long
using namespace std;
mt19937_64 rnd(time(0));
const int MAXN=2e5+5,MAXM=6e5+5;
int n,m,q,a[MAXN][3],b[MAXN][3],rp[MAXN];
ull hv[MAXN],A[MAXM],B[MAXM];
signed main() {
	ios::sync_with_stdio(false);
	cin>>n>>m>>q;
	for(int i=1;i<=n;++i) hv[i]=rnd();
	for(int i=1;i<=n;++i) cin>>a[i][0]>>a[i][1]>>a[i][2];
	for(int i=1;i<=n;++i) cin>>b[i][0]>>b[i][1]>>b[i][2];
	for(int i=1,j=0;i<=n;++i) {
		while(j<n) {
			vector <ull> mA,mB;
			for(int k:a[j+1]) mA.push_back(A[k]^hv[j+1]),mB.push_back(A[k]);
			for(int k:b[j+1]) mB.push_back(B[k]^hv[j+1]),mA.push_back(B[k]);
			sort(mA.begin(),mA.end()),sort(mB.begin(),mB.end());
			bool flg=1;
			for(int k:{0,1,2,3,4,5}) flg&=(mA[k]==mB[k]);
			if(!flg) break;
			++j;
			for(int k:a[j]) A[k]^=hv[j];
			for(int k:b[j]) B[k]^=hv[j];
		}
		rp[i]=j;
		for(int k:a[i]) A[k]^=hv[i];
		for(int k:b[i]) B[k]^=hv[i];
	}
	for(int l,r;q--;) cin>>l>>r,cout<<(r<=rp[l]?"Yes\n":"No\n");
	return 0;
}