#include<bits/stdc++.h>
#define F(i, j, k) for(int i=(j); i<=(k); ++i)
#define R(i, j, k) for(int i=(j); i>=(k); --i)
#define G(v, i, u) for(int i=head[u], v=e[i].v; i; v=e[i=e[i].nxt].v)
#define de(x) cout<<#x<<" "<<x<<"  "
#define nd cout<<endl
#define P cout<<"Line:"<<" "<<__LINE__<<endl
#define fin(x) freopen(x, "r", stdin)
#define fout(x) freopen(x, "w", stdout)
using namespace std;
typedef unsigned long long ull;
const int N=2e5+7, M=6e5+7;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n, m, q, a[N][3], b[N][3], pos[N];
ull w[N], sa[M], sb[M], msk, s1, s2; 

ull shf(ull x){
	x^=msk, x^=x<<7, x^=x>>11, x^=x<<13;
	return x; 
}

void upd(int p, ull d){
	for(auto x:a[p]) s1-=shf(sa[x]), sa[x]+=d*w[p], s1+=shf(sa[x]); 
	for(auto x:b[p]) s2-=shf(sb[x]), sb[x]+=d*w[p], s2+=shf(sb[x]);
}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n>>m>>q;
    F(i, 1, n) cin>>a[i][0]>>a[i][1]>>a[i][2];
    F(i, 1, n) cin>>b[i][0]>>b[i][1]>>b[i][2];
    F(i, 1, n) pos[i]=N;
    int T=1;
    while(T--){
    	msk=rng();
    	F(i, 1, n) w[i]=rng();
    	for(int i=1, j=1; i<=n; upd(i, -1), ++i){
			while(j<=n && s1==s2) upd(j, 1), ++j;
    		if(s1==s2) pos[i]=min(pos[i], j-1);
    		else pos[i]=min(pos[i], j-2);
		}
	}
//	F(i, 1, n) de(i), de(pos[i]), nd;
	while(q--){
		int a, b; cin>>a>>b;
		cout<<(pos[a]<b?"No\n":"Yes\n");
	}
}