// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 600006
#define inf 0x3f3f3f3f

int n,m,Q,a[maxn][3],b[maxn][3];
mt19937_64 rnd(time(0));
int tmpa[maxn],tmpb[maxn],nxta[maxn][3],nxtb[maxn][3];

int maxr[maxn];
ull val[maxn];
ull sa[600005],sb[600005];
int per[4];
bool chk(int ii){
	For(i,0,2)per[i]=i;
	do{
		bool ok=1;
		For(i,0,2) ok&=(sa[a[ii][i]]==sb[b[ii][per[i]]]);
		if(ok)return 1;
	}while(next_permutation(per,per+3));
	return 0;
}

signed main()
{
	n=read(),m=read(),Q=read();
	For(i,1,n)val[i]=rnd();
	For(i,1,n)For(j,0,2)a[i][j]=read();
	For(i,1,n)For(j,0,2)b[i][j]=read();
	maxr[n+1]=n;
	Rep(i,n,1){
		For(j,0,2){
			nxta[i][j]=tmpa[a[i][j]],tmpa[a[i][j]]=i;
			nxtb[i][j]=tmpb[b[i][j]],tmpb[b[i][j]]=i;
			sa[a[i][j]]+=val[i];
			sb[b[i][j]]+=val[i];
		}
		maxr[i]=maxr[i+1];
		while(!chk(i)){
			int p=maxr[i]; --maxr[i];
			For(j,0,2){
				sa[a[p][j]]-=val[p];
				sb[b[p][j]]-=val[p];
			}
		}
	}
	For(_,1,Q){
		int l=read(),r=read();
		if(r<=maxr[l])puts("Yes");
		else puts("No");
	}
	return 0;
}
/*

*/