#include <bits/stdc++.h>
using std::bitset;
using std::cout;
using std::deque;
using std::endl;
using std::greater;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using std::min;
using std::multimap;
using std::multiset;
using std::nth_element;
using std::pair;
using std::priority_queue;
using std::queue;
using std::reverse; 
using std::set;
using std::sort;
using std::sqrt;
using std::stable_sort;
using std::string;
using std::swap;
using std::unique;
using std::upper_bound;
using std::vector;
typedef long long li;
typedef long double lf;
		
inline li read(){
	li ans = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		f = (ch == '-') ? -1 : 1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans * f;
} 
		
li n, m, q;
const li base = 114251;
li R[200010];
		
li G(li x){
	return 191981 * x * x * x * x - 114514 * x * x * x - 363415 * x * x + 251251 * x - 2333333;
}
li now[600010][2], a[200010][5][2], poww[600010], ans[2];
std::mt19937_64 rng(251);
		
int main(){
//	 freopen("wonderful.ans", "r", stdin);
//	 freopen("www.ww", "w", stdout); 
	n = read(), m = read(), q = read();
	poww[0] = 1;
	for(li i = 1; i <= 6e5; i++) poww[i] = rng();
	for(li i = 1; i <= n; i++){
		a[i][1][0] = read(), a[i][2][0] = read(), a[i][3][0] = read();
	}
	for(li i = 1; i <= n; i++){
		a[i][1][1] = read(), a[i][2][1] = read(), a[i][3][1] = read();
	}
	li r = 0;
	for(li l = 1; l <= n; l++){
		while(r <= n && ans[1] == ans[0]){
//			cout << l << " " << r << endl;
			r++;
			for(li i = 0; i < 2; i++){
				for(li j = 1; j <= 3; j++){
//					printf("ans %lld -= G(%lld)\n", i, now[a[r][j][i]][i]);
					ans[i] -= G(now[a[r][j][i]][i]);
					now[a[r][j][i]][i] += poww[r];
//					printf("ans %lld += G(%lld)\n", i, now[a[r][j][i]][i]);
					ans[i] += G(now[a[r][j][i]][i]);
				}
			}
		}
		for(li i = 0; i < 2; i++){
			for(li j = 1; j <= 3; j++){
//				printf("ans %lld -= G(%lld)\n", i, now[a[l][j][i]][i]);
				ans[i] -= G(now[a[l][j][i]][i]);
				now[a[l][j][i]][i] -= poww[l];
//				printf("ans %lld += G(%lld)\n", i, now[a[l][j][i]][i]);
				ans[i] += G(now[a[l][j][i]][i]);
			}
		}
		R[l] = r - 1;
		if(R[l] < l) r = l - 1, ans[0] = ans[1] = 0;
//		printf("r %lld = %lld\n", l, R[l]);
	}
	while(q--){
		li x = read(), y = read();
		if(R[x] >= y) puts("Yes");
		else puts("No");
	}
	return 0;
}