#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n,m,q,x,y,now = 1,a[200009][3],b[200009][3],c[200009];
ull ta,tb,ca[600009],cb[600009];
inline ll read(){
	ll s = 0,w = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();}
	while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar();
	return s * w;
}
ull qp(ull x,ull y){
	ull a = 1,b = x;
	while (y){
		if (y & 1) a *= b;
		b *= b,y >>= 1;
	}
	return a;
}
void add(ll x,bool opt){
	for (ll i = 0;i < 3;i += 1){
		ta -= qp(1000000007,ca[a[x][i]]),tb -= qp(1000000007,cb[b[x][i]]);
		if (opt) ca[a[x][i]] += qp(998244353,x),cb[b[x][i]] += qp(998244353,x);
		else ca[a[x][i]] -= qp(998244353,x),cb[b[x][i]] -= qp(998244353,x);
		ta += qp(1000000007,ca[a[x][i]]),tb += qp(1000000007,cb[b[x][i]]);
	}
}
int main(){
	n = read(),m = read(),q = read();
	for (ll i = 1;i <= n;i += 1) for (ll j = 0;j < 3;j += 1) a[i][j] = read();
	for (ll i = 1;i <= n;i += 1) for (ll j = 0;j < 3;j += 1) b[i][j] = read();
	for (ll i = 1;i <= n;i += 1){
		add(i,1);
		while (ta != tb) add(now ++,0);
		c[i] = now;
	}
	while (q --) x = read(),y = read(),puts(c[y] <= x ? "Yes" : "No");
	return 0;
}