// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull; 
typedef pair<int,int> pii; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; typedef pair<int,ll> pil;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=2e5+3;
const int M=6e5+3;
const int mod=998244353;
inline void Ad(int &x,int y){x=x+y>=mod?x+y-mod:x+y;}
inline void Mi(int &x,int y){x=x-y<0?x-y+mod:x-y;}
// clang-format on
int n,m,q,lim[N];
int p2[N],a[M],b[M],cnt=0;
unordered_map<int,int>mp;
inline void add(int x,int k){
	if(mp[x]==0)++cnt;
	mp[x]+=k;
	if(mp[x]==0)--cnt;
}
int A[N][3],B[N][3];
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	n=read(),m=read(),q=read();
	p2[0]=1;rep(i,1,n)p2[i]=2ll*p2[i-1]%mod;
	rep(i,1,n)rep(d,0,2)A[i][d]=read();
	rep(i,1,n)rep(d,0,2)B[i][d]=read();
	int l=1;
	rep(r,1,n){
		rep(d,0,2){
			int x=A[r][d];
			add(a[x],-1);
			Ad(a[x],p2[r]);
			add(a[x],1);
		}
		rep(d,0,2){
			int x=B[r][d];
			add(b[x],1);
			Ad(b[x],p2[r]);
			add(b[x],-1);
		}
		while(cnt!=0){
			rep(d,0,2){
				int x=A[l][d];
				add(a[x],-1);
				Mi(a[x],p2[l]);
				add(a[x],1);
			}
			rep(d,0,2){
				int x=B[l][d];
				add(b[x],1);
				Mi(b[x],p2[l]);
				add(b[x],-1);
			}
			++l;
		}
		lim[r]=l;
	}
	while(q--){
		int l=read(),r=read();
		if(lim[r]<=l)printf("Yes\n");
		else printf("No\n");
	}
    return 0;
}