#include <bits/stdc++.h>
using namespace std;
const int N = 6e5 + 10;
int n, m, q, ans[N], bad;
unsigned long long w[N];
mt19937 rnd(time(0));
map<unsigned long long, int> mp;
struct s{
	int v[N][3], coef;
	unsigned long long t[N];
	void init(int c) {
		for(int i = 1; i <= n; i++)
			for(int j = 0; j < 3; j++)
				cin >> v[i][j];
		coef = c;
	}
	void upd(int p, int c) {
		for(int i = 0; i < 3; i++) {
			auto u1 = &mp[t[v[p][i]]];
			bad -= !!*u1, *u1 -= coef, bad += !!*u1;
			t[v[p][i]] += c * w[p];
			auto u2 = &mp[t[v[p][i]]];
			bad -= !!*u2, *u2 += coef, bad += !!*u2;
		}
	}
}a, b;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	cin >> n >> m >> q;
	for(int i = 1; i <= n; i++) w[i] = rnd();
	a.init(1), b.init(-1);
	for(int l = 1, r = 1; r <= n; r++) {
		a.upd(r, 1), b.upd(r, 1);
		while(bad) a.upd(l, -1), b.upd(l, -1), l++;
		ans[r] = l;
	}
	while(q--) {
		int l, r;
		cin >> l >> r;
		cout << ((l >= ans[r]) ? "Yes\n" : "No\n");
	}
	return 0;
}