#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;using pii=pair<int,int>;
const int N=6e5+5,M=N*100+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=5e18+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,q,A[N][3],B[N][3];
ull w[N];
struct Ha{
	ull f[N],sum;
	void insert(int x,int y){
		sum-=f[x];
		f[x]^=w[y];
		sum+=f[x];
	}
}a,b;
int ans[N];
void Solve(){
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;i++) for(int j:{0,1,2}) scanf("%d",&A[i][j]);
	for(int i=1;i<=n;i++) for(int j:{0,1,2}) scanf("%d",&B[i][j]);
	mt19937_64 rnd(time(0));
	for(int i=1;i<=n;i++) w[i]=rnd();
	int R=1;
	for(int i=1;i<=n;i++){
		for(int j:{0,1,2}) a.insert(A[i][j],i);
		for(int j:{0,1,2}) b.insert(B[i][j],i);
		while(a.sum^b.sum){
			for(int j:{0,1,2}) a.insert(A[R][j],R);
			for(int j:{0,1,2}) b.insert(B[R][j],R);
			R++;
		}
		ans[i]=R;
	}
	while(q--){
		int x,y;scanf("%d%d",&x,&y);
		puts(ans[y]<=x?"Yes":"No");
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}