#include<bits/stdc++.h>
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
#define deb(x) cerr << #x"=" << x << '\n';
using namespace std;
using ull = unsigned long long;
const int N = 6e5 + 5;
int n, m, q, cnt, a[N][3], b[N][3], pos[N];
ull w[N], ha[N], hb[N];
unordered_map<ull, int> mp;
mt19937_64 nrd(chrono::steady_clock::now().time_since_epoch().count());
void add(int x){
	if(mp[x] == -1) cnt--;
	else if(mp[x] == 0) cnt++;
	mp[x]++;
}
void del(int x){
	if(mp[x] == 1) cnt--;
	else if(mp[x] == 0) cnt++;
	mp[x]--;
}
void Add(int p){
	del(ha[a[p][0]]); del(ha[a[p][1]]); del(ha[a[p][2]]);
	ha[a[p][0]] += w[p]; ha[a[p][1]] += w[p]; ha[a[p][2]] += w[p];
	add(ha[a[p][0]]); add(ha[a[p][1]]); add(ha[a[p][2]]);

	add(hb[b[p][0]]); add(hb[b[p][1]]); add(hb[b[p][2]]);
	hb[b[p][0]] += w[p]; hb[b[p][1]] += w[p]; hb[b[p][2]] += w[p];
	del(hb[b[p][0]]); del(hb[b[p][1]]); del(hb[b[p][2]]);
}
void Del(int p){
	del(ha[a[p][0]]); del(ha[a[p][1]]); del(ha[a[p][2]]);
	ha[a[p][0]] -= w[p]; ha[a[p][1]] -= w[p]; ha[a[p][2]] -= w[p];
	add(ha[a[p][0]]); add(ha[a[p][1]]); add(ha[a[p][2]]);

	add(hb[b[p][0]]); add(hb[b[p][1]]); add(hb[b[p][2]]);
	hb[b[p][0]] -= w[p]; hb[b[p][1]] -= w[p]; hb[b[p][2]] -= w[p];
	del(hb[b[p][0]]); del(hb[b[p][1]]); del(hb[b[p][2]]);	
}
void Solve(){
	cin >> n >> m >> q;
	For(i, 1, n) cin >> a[i][0] >> a[i][1] >> a[i][2];
	For(i, 1, n) cin >> b[i][0] >> b[i][1] >> b[i][2];
	For(i, 1, n) w[i] = nrd();
	for(int i = 1, j = 0; i <= n; i++){
		while(j <= n && cnt == 0) Add(++j);
		Del(i); pos[i] = j - 1;
	}
	while(q--){
		int l, r; cin >> l >> r;
		cout << (pos[l] >= r ? "Yes" : "No") << '\n';
	}
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int T = 1; //cin >> T;
	while(T--) Solve();
	return 0;
}