#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=2e5+10,M=6e5+10;
int n,m,q,a[N][3],b[N][3],ans[N];
void solve(int base,int mod){
	static int pw[N],ta[M],tb[M],oa[M],ob[M];
	for(int i=pw[0]=1;i<=n;i++)pw[i]=1ll*pw[i-1]*base%mod;
	int wa=0,wb=0;
	for(int i=n,j=n;i>=1;i--){
		for(int k=0;k<3;k++){
			ta[a[i][k]]++;
			int &w=oa[a[i][k]];
			wa=(wa+1ll*(mod-w)*w)%mod;
			w=(1ll*w*base+i)%mod;
			wa=(wa+1ll*w*w)%mod;
		}
		for(int k=0;k<3;k++){
			tb[b[i][k]]++;
			int &w=ob[b[i][k]];
			wb=(wb+1ll*(mod-w)*w)%mod;
			w=(1ll*w*base+i)%mod;
			wb=(wb+1ll*w*w)%mod;
		}
		for(;j>i&&wa!=wb;j--){
			for(int k=0;k<3;k++){
				int &w=oa[a[j][k]];
				wa=(wa+1ll*(mod-w)*w)%mod;
				w=(w+1ll*(mod-pw[--ta[a[j][k]]])*j)%mod;
				wa=(wa+1ll*w*w)%mod;
			}
			for(int k=0;k<3;k++){
				int &w=ob[b[j][k]];
				wb=(wb+1ll*(mod-w)*w)%mod;
				w=(w+1ll*(mod-pw[--tb[b[j][k]]])*j)%mod;
				wb=(wb+1ll*w*w)%mod;
			}
		}
		ans[i]=min(ans[i],j);
	}
	for(int i=1;i<=m;i++){
		ta[i]=tb[i]=oa[i]=ob[i]=0;
	}
}
int main(){
	scanf("%d%d%d",&n,&m,&q);
	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]);
	}
	fill(ans+1,ans+1+n,n);
	solve(19260817,1e9+7);
	solve(19260817,1e9+9);
	solve(19260817,998244353);
	for(int l,r;q--;){
		scanf("%d%d",&l,&r);
		puts(ans[l]>=r?"Yes":"No");
	}
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif