#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
using namespace std;
const int N = 2e5;
const int M = 6e5;

int n, m, q;
struct node{
	int s[3];
}a[N + 5], b[N + 5];

int w[N + 5];

ll ha[M + 5], hb[M + 5];

ull suma, sumb;
inline void update(int x, int f){
	for(int i = 0; i < 3; ++ i){
		// suma -= ha[a[x].s[i]] * ha[a[x].s[i]];
		suma -= ha[a[x].s[i]] * ha[a[x].s[i]] * ha[a[x].s[i]];
		ha[a[x].s[i]] = ha[a[x].s[i]] + f * w[x];
		// cout << a[x].s[i] << ": " << ha[a[x].s[i]] << '\n';
		// suma += ha[a[x].s[i]] * ha[a[x].s[i]];
		suma += ha[a[x].s[i]] * ha[a[x].s[i]] * ha[a[x].s[i]];
		// cout << suma << '\n';
		
		// sumb -= hb[b[x].s[i]] * hb[b[x].s[i]];
		sumb -= hb[b[x].s[i]] * hb[b[x].s[i]] * hb[b[x].s[i]];
		hb[b[x].s[i]] = hb[b[x].s[i]] + f * w[x];
		// cout << b[x].s[i] << ": " << hb[b[x].s[i]] << '\n';
		// sumb += hb[b[x].s[i]] * hb[b[x].s[i]];
		sumb += hb[b[x].s[i]] * hb[b[x].s[i]] * hb[b[x].s[i]];
	}
}

int r[N + 5];
int x, y;

int main(){
	// freopen("a.out", "w", stdout);

	ios::sync_with_stdio(false);

	cin >> n >> m >> q;
	for(int i = 1; i <= n; ++ i) cin >> a[i].s[0] >> a[i].s[1] >> a[i].s[2];
	for(int i = 1; i <= n; ++ i) cin >> b[i].s[0] >> b[i].s[1] >> b[i].s[2];
	
	for(int i = 1; i <= n; ++ i) w[i] = rand();
	// for(int i = 1; i <= n; ++ i) cout << w[i] << ' '; cout << '\n';

	int j = 0;
	for(int i = 1; i <= n; ++ i){
		// cout << i << ":\n";
		// cout << suma << ' ' << sumb << '\n';
		while(j < i || (j < n && suma == sumb)) update(++ j, 1);
		r[i] = suma == sumb ? j : j - 1;
		update(i, -1);
	}

	// for(int i = 1; i <= n; ++ i){
	// 	cout << i << ' ' << r[i] << '\n';
	// }

	while(q --){
		cin >> x >> y;
		cout << (r[x] >= y ? "Yes\n" : "No\n");
	}

	return 0;
}
/*
双指针
判断集合相等
*/